-
Hello, thank you for your excellent work! One key contribution of your paper is the optimization of $\{t_K\}$ and noise, but I couldn't find the code for that part in the open-source release. I'm cur…
-
Hello, I am trying to optimize the sparse reconstruction pipeline. I've found a list of parameters that one can pass to the incremental mapper via the python bindings:
[https://github.com/colmap/colm…
-
Hi all,
when running **geometry optimization with Quantum Espresso** via the calculation = 'relax' command with a small maximum number of relaxation steps (e.g. 20) the calculation will result in an …
ghost updated
2 years ago
-
Dear JAXOPT developers,
I'm interested in constrained optimization problems, which naturally leads to solving KKT systems. For large scale problems, an iterative solver is needed. As KKT matrix is …
-
A new primal heuristic was recently proposed in [The granularity concept in mixed-integer optimization](https://www.youtube.com/watch?v=V9LffQMyeJk). The idea is to define a subset of the feasible set…
-
Found a small typo in this part - marked the word with bold:
"2.3. Notes on Optimization
The scipy.optimize.minimize uses a variant of Gradient descent to find an optimal set of parameters (a,b).…
-
### 📚 The doc issue
In the provided examples, the least square problem optimizes over all the parameters. However, in some applications, parts of the parameters are from the neural network and should…
-
This is the current implementation of `partitions`:
```py
def partitions(iterable):
sequence = list(iterable)
n = len(sequence)
for i in powerset(range(1, n)):
yield [seque…
-
Just saw your video about the physics, great stuff! As soon as I saw the video title I thought of that Teardown talk so I was so glad when you not only mentioned it but based your implementation on it…
-
I need to solve linear systems `A * x = b` where `x` and `b` have 2 or 3 columns (the application is for interior point optimization routines: specifically finding prediction and correction directions…