Nonmonotone bundle-type scheme for convex nonsmooth minimization

DOI10.1007/BF00939607zbMath0802.49011MaRDI QIDQ1321299

Francisco Facchinei, Stefano Lucidi

Publication date: 1 December 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

numerical examplesconvex programmingnonmonotonicitybundle-type algorithms

Mathematics Subject Classification ID

Nonsmooth analysis (49J52)

Related Items

Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds, An ODE-like nonmonotone method for nonsmooth convex optimization, On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization, Globally convergent variable metric method for convex nonsmooth unconstrained minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proximity control in bundle methods for convex nondifferentiable minimization
• Methods of descent for nondifferentiable optimization
• An aggregate subgradient method for nonsmooth convex minimization
• A descent algorithm for nonsmooth convex optimization
• An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
• Optimization and nonsmooth analysis
• A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
• A bundle type approach to the unconstrained minimization of convex nonsmooth functions
• Quadratic Approximations in Convex Nondifferentiable Optimization
• Minimization of Locally Lipschitzian Functions
• 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 Nonmonotone Line Search Technique for Newton’s Method
• Numerical methods for nondifferentiable convex optimization
• Convex Analysis
• On the solution of the generalized steiner problem by the subgradient method