A constraint linearization method for nondifferentiable convex minimization
From MaRDI portal
Publication:1099787
DOI10.1007/BF01397543zbMath0638.90083OpenAlexW2075003630MaRDI QIDQ1099787
Publication date: 1987
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133202
bundle methodsconstrained minimizationsubgradientsexact penalty functionnonsmooth convex problemssuccessive quadratic programming approximation
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
Survey of Bundle Methods for Nonsmooth Optimization, A variable metric method for nonsmooth convex constrained optimization, An algorithm for calculating one subgradient of a convex function of two variables, Limited memory interior point bundle method for large inequality constrained nonsmooth minimization, Proximity control in bundle methods for convex nondifferentiable minimization, A successive quadratic programming method for a class of constrained nonsmooth optimization problems, Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization, A bundle-filter method for nonsmooth convex constrained optimization, Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization, A filter-variable-metric method for nonsmooth convex constrained optimization, An inexact bundle variant suited to column generation, Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming, Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some remarks on the construction of higher order algorithms in convex optimization
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- Methods of descent for nondifferentiable optimization
- The Cutting-Plane Method for Solving Convex Programs
- Equivalence of some quadratic programming algorithms
- A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- An Algorithm for Constrained Optimization with Semismooth Functions
- Numerical methods for nondifferentiable convex optimization
- Sufficiency of Exact Penalty Minimization
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
