A method of linearizations for linearly constrained nonconvex nonsmooth minimization
From MaRDI portal
Publication:3730358
DOI10.1007/BF01580582zbMath0596.90078OpenAlexW2048884479MaRDI QIDQ3730358
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580582
nonsmooth optimizationpolyhedral approximationlinear constraintsdescentmethodssubgradientsnondifferentiable programminglocally Lipschitz continuous function
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of successive quadratic programming type (90C55)
Related Items
Survey of Bundle Methods for Nonsmooth Optimization, A proximal alternating linearization method for nonconvex optimization problems, Limited memory interior point bundle method for large inequality constrained nonsmooth minimization, Proximity control in bundle methods for convex nondifferentiable minimization, Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization, A bundle-type auxiliary problem method for solving generalized variational-like inequalities, Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization, Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization of upper semidifferentiable functions
- A method for minimizing the sum of a convex function and a continuously differentiable function
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- Methods of descent for nondifferentiable optimization
- An aggregate subgradient method for nonsmooth convex minimization
- A Linearization Algorithm for Nonsmooth Minimization
- Optimization and nonsmooth analysis
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Linearly constrained minimax optimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- Convex Analysis