Variants to the cutting plane approach for convex nondifferentiable optimization

DOI10.1080/02331939208843808zbMath0817.90076OpenAlexW2082476974MaRDI QIDQ4327932

Maria Flavia Monaco, Manlio Gaudioso

Publication date: 1 August 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843808

zbMATH Keywords

cutting planebundle methodspiecewise linear approximationsquadratic penaltyconvex nondifferentiable minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonsmooth analysis (49J52)

Related Items (13)

The Newton direction and the cutting plane ⋮ Comparing different nonsmooth minimization methods and software ⋮ Survey of Bundle Methods for Nonsmooth Optimization ⋮ A bundle modification strategy for convex minimization ⋮ A method for convex minimization based on translated first-order approximations ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations ⋮ Essentials of numerical nonsmooth optimization ⋮ Diagonal discrete gradient bundle method for derivative free nonsmooth optimization ⋮ Subgradient and Bundle Methods for Nonsmooth Optimization ⋮ On the generalization of ECP and OA methods to nonsmooth convex MINLP problems ⋮ Essentials of numerical nonsmooth optimization ⋮ Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization

Cites Work

• Proximity control in bundle methods for convex nondifferentiable minimization
• An algorithm for composite nonsmooth optimization problems
• A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
• A bundle type approach to the unconstrained minimization of convex nonsmooth functions
• Quadratic Approximations in Convex Nondifferentiable Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Variants to the cutting plane approach for convex nondifferentiable optimization