New answers tagged


Traditionally, the convergence of optimization algorithms has been analyzed in terms of the asymptotic rate of convergence. A quadratically convergent algorithm has $x_{k} \rightarrow x^{*}$ and $\lim_{k \rightarrow \infty} \frac{\| x_{k+1}-x^{*} \|}{\| x_{k}-x^{*} \|^{2}}=L< \infty$ while a linearly convergent algorithm has $\lim_{k \rightarrow \infty} \...


Also possibly of interest (as of Sep-21) is the software package Drake and its python bindings pydrake, which give interfaces to a pretty wide range of solvers.

Top 50 recent answers are included