
iPiano
 Referenced in 68 articles
[sw09623]
 solving a minimization problem composed of a differentiable (possibly nonconvex) and a convex (possibly nondifferentiable...

QSM
 Referenced in 20 articles
[sw06161]
 quasisecant method for nonsmooth possibly nonconvex minimization. The user can employ either analytically calculated...

HANSO
 Referenced in 18 articles
[sw05271]
 sampling methods. For general unconstrained minimization: convex or nonconvex, smooth or nonsmooth, including BFGS, limited...

PBNCGC
 Referenced in 22 articles
[sw06156]
 proximal bundle method for nonconvex, nonsmooth (nondifferentiable) and generally constrained minimization. The software is free...

MPBNGC
 Referenced in 22 articles
[sw11891]
 proximal bundle method for nonconvex, nonsmooth (nondifferentiable) and generally constrained minimization. The software is free...

alphaBB
 Referenced in 49 articles
[sw06249]
 parameter as defined in [17] to underestimate nonconvex terms of generic structure. The proposed branch ... solution of a series of nonlinear convex minimization problems. The global optimization method, ffBB...

QICD
 Referenced in 20 articles
[sw19679]
 Iterative Coordinate Descent Algorithm for Highdimensional Nonconvex Penalized Quantile Regression. This algorithm combines ... inner iteration with the majorization minimization step in the outside step. For each inner univariate...

PyBOBYQA
 Referenced in 1 article
[sw32721]
 finding local solutions to nonlinear, nonconvex minimization problems (with optional bound constraints), without requiring...

LMBM
 Referenced in 3 articles
[sw06158]
 method for general, possible nonconvex, nonsmooth (nondifferentiable) largescale minimization. Both the unconsrained version...

SpaRSA
 Referenced in 3 articles
[sw20467]
 minimizing the sum of a smooth convex function and a nonsmooth, possibly nonconvex regular izer...

SESync
 Referenced in 12 articles
[sw40678]
 This problem is typically formulated as a nonconvex maximumlikelihood estimation that is computationally hard ... relaxation of the maximumlikelihood estimation whose minimizer provides an exact MLE so long...

LPCCbnc
 Referenced in 5 articles
[sw31750]
 with linear complementarity constraints (LPCC) requires the minimization of a linear objective over ... complementarity constraints results in a nonconvex optimization problem. We develop a branchandcut algorithm...

MUSCOP
 Referenced in 7 articles
[sw06143]
 efficient solver for the resulting, possibly nonconvex QP. Furthermore we construct three illustrative, counterintuitive ... hybrid language programming paradigm to minimize setup and solution time for new application problems...

BARON
 Referenced in 361 articles
[sw00066]
 BARON is a computational system for solving nonconvex...

CSDP
 Referenced in 206 articles
[sw00169]
 CSDP, A C Library for Semidefinite Programming. This...

GLOPT
 Referenced in 19 articles
[sw00359]
 GLOPT is a Fortran 77 program for global...

Gmsh
 Referenced in 783 articles
[sw00366]
 Gmsh is a 3D finite element grid generator...

HSL
 Referenced in 284 articles
[sw00418]
 HSL (formerly the Harwell Subroutine Library) is a...

KNITRO
 Referenced in 200 articles
[sw00490]
 KNITRO is a solver for nonlinear optimization. It...