A variable metric method for nonsmooth convex constrained optimization
From MaRDI portal
Publication:865537
DOI10.1016/j.amc.2006.05.132zbMath1112.65056OpenAlexW2067375490MaRDI QIDQ865537
Publication date: 19 February 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.132
global convergenceconstrained optimizationmathematical programmingnonsmooth convex optimizationmethods of successive quadratic programming
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55)
Related Items
A filter-variable-metric method for nonsmooth convex constrained optimization, A globally convergent trust region multidimensional filter SQP algorithm for nonlinear programming
Uses Software
Cites Work
- Unnamed Item
- Proximity control in bundle methods for convex nondifferentiable minimization
- A constraint linearization method for nondifferentiable convex minimization
- Test examples for nonlinear programming codes
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- A cutting plane algorithm for convex programming that uses analytic centers
- An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- An Algorithm for Constrained Optimization with Semismooth Functions
- A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
- Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Nonlinear programming without a penalty function.
