Comments (4)
It looks like you're calling the solvers correctly.
Regarding point 1. these are functions that are not exported by ProximalAlgorithms to this package but rather to AbstractOperators and ProximalOperators. So this issue is not related to this package.
Are you saying that having 1. and 2. will get you to all(isapprox.(xp2[13,13,:],1.0;rtol=1e-4)) = true
?
from proximalalgorithms.jl.
Hi, and sorry if I wasn't clear. I'm trying to reduce allocations arising from redefining f
and A
at every iteration. This might be possible by simply using a different approach, i.e., without changing anything in ProximalAlgorithms
or AbstractOperators
. Or possibly it requires either 1. or 2. Broadcasting would help because f
and A
could be overwritten in-place.
The issue in the 3D case is that the value xp2[13,13,:]
is underestimated possibly due to the computation of gamma
with a 3D operator A
(I haven't investigated how gamma
is computed exactly).
from proximalalgorithms.jl.
I'm not sure that having gamma
set to the optimal one will get your condition satisfied. Having optimal gamma
might only get you to the optimal solution with less iterations. My impression is that your condition may simply be unfeasible. However, I'm not familiar with your problem.
Concerning the allocations of f
and A
, this is related to ProximalOperators and AbstractOperator respectively. Just open an issue in the right package and we can discuss about it!
from proximalalgorithms.jl.
Thanks! Will look into the details and open a new issue if the issue persist.
from proximalalgorithms.jl.
Related Issues (20)
- Further allocation savings in FBS, PANOC
- Algorithms are not exported HOT 5
- Question about reproting data HOT 1
- Add flag to hide warnings HOT 8
- Problem solving a simple SDP in ProximalAlgorithms.jl HOT 7
- Tests on number of iterations are sensitive to randn HOT 4
- pull request gone wrong HOT 1
- TagBot trigger issue HOT 6
- Missing iterator methods
- Improve verbose mode
- Autodiff backends HOT 7
- Use 5-arguments mul!
- Sparse regression example no longer working HOT 12
- Clarify that ProximalOperator >= 0.15 is needed, if used HOT 1
- Documentation: expand sparse least squares example to other algorithms (Douglas-Rachford) HOT 7
- Remove Zygote dependency by switching to AbstractDifferentiation HOT 12
- [question] Achieve constraints via return of Inf HOT 3
- Question on DavisYin algorithm HOT 2
- Auto increase gamma HOT 2
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from proximalalgorithms.jl.