Piecewise-quadratic Approximations in Convex Numerical Optimization
From MaRDI portal
Publication:3225237
DOI10.1137/100817930zbMath1236.90092OpenAlexW2003939156WikidataQ62473099 ScholiaQ62473099MaRDI QIDQ3225237
Enrico Gorgone, Antonio Frangioni, Manlio Gaudioso, Annabella Astorino
Publication date: 16 March 2012
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100817930
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items
Lagrangian relaxation for SVM feature selection, A method for convex minimization based on translated first-order approximations, A simple version of bundle method with linear programming, Fast bundle-level methods for unconstrained and ball-constrained convex optimization, A version of bundle trust region method with linear programming, A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization, Incremental Bundle Methods using Upper Models, Large-scale unit commitment under uncertainty: an updated literature survey, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, A proximal bundle method for nonsmooth nonconvex functions with inexact information, Essentials of numerical nonsmooth optimization, A splitting bundle approach for non-smooth non-convex minimization, Essentials of numerical nonsmooth optimization, Large-scale unit commitment under uncertainty, A doubly stabilized bundle method for nonsmooth convex optimization
