Daniel Vainsencher

Results 35 comments of Daniel Vainsencher

Ran it 1.7.2, with Manifest.toml saying: ``` ... 1054:[[deps.ProximalAlgorithms]] 1055:deps = ["LinearAlgebra", "Printf", "ProximalOperators"] 1056-git-tree-sha1 = "55476be8224b3db55f0bf862f2f84ac8597aaae5" 1057-uuid = "140ffc9f-1907-541a-a177-7475e0a401e9" 1058-version = "0.4.1" 1059- 1060:[[deps.ProximalOperators]] 1061-deps = ["IterativeSolvers", "LinearAlgebra", "OSQP",...

I've fixed one of the benchmarks locally. Are PRs in this direction desired?

Have TotalVariation.jl working at draft PR https://github.com/JuliaFirstOrder/StructuredOptimization.jl/pull/39. Feedback there welcome.

Hi, I think its ready for inclusion now. I'm not so sure about variable names in this context (numerical computation); the mathy one letter names have their own readability benefits....

body p { margin-bottom: 5px; margin-top: 0pt; } No problem. No, I would call this folklore. There are two aspects: solving projection to simplex as search in one dimension, which...

My optimization algorithms are typically some initialization and then a loop. The body of the loop has several actions. My main goal is to understand the cost of the in-loop...

On second thought, what I should probably do is give up on wrapping the whole loop, but instead wrap the initialization code by its own span. Ok, that's reasonable.

It seems each user has different expectations about what frames mean... to me it was obvious we sum over frames: since frames are likely to be similar, I want to...

How do you plan to treat spans over a sequence of frames? summing as I'd prefer, or you have something else in mind?

Of course you will keep the design fit for your own purposes, but I will explain my point of view, maybe you'll find it useful. Frames are a special case...