Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
Year of publication: |
May 2016
|
---|---|
Authors: | Bolte, Jérôme ; Pauwels, Edouard |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 41.2016, 2, p. 442-465
|
Subject: | SQP methods | majorization-minimization | Sℓ1QP | moving balls method | extended sequential quadratic method | KKT points | KL inequality | nonlinear programming | converging methods | tame optimization | Theorie | Theory | Nichtlineare Optimierung | Nonlinear programming | Mathematische Optimierung | Mathematical programming |
-
On the design of R-based scalable frameworks for data science applications
Theußl, Stefan Peter, (2020)
-
JSOSuite.jl : solving continuous optimization problems with JuliaSmoothOptimizers
Migot, Tangi, (2024)
-
Procurement strategy with credit risk
Wang, Hsiao-fan, (2013)
- More ...
-
Subgradient sampling for nonsmooth nonconvex minimization
Bolte, Jérôme, (2022)
-
Curiosities and counterexamples in smooth convex optimization
Bolte, Jérôme, (2020)
-
"Long term dynamics of the subgradient method for Lipschitz path differentiable functions"
Bolte, Jérôme, (2020)
- More ...