A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions

DOI10.1155/2014/192893zbMath1470.90160OpenAlexW2164284121WikidataQ59035940 ScholiaQ59035940MaRDI QIDQ1722320

Li-Ping Pang, Dan Li, Jie Shen

Publication date: 14 February 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/192893

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (1)

A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence

Cites Work

• A doubly stabilized bundle method for nonsmooth convex optimization
• Newton's method for convex programming and Tschebyscheff approximation
• New variants of bundle methods
• Tuning strategy for the proximity parameter in convex minimization
• The Cutting-Plane Method for Solving Convex Programs
• Optimization and nonsmooth analysis
• A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
• Optimization of lipschitz continuous functions
• Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
• A proximal bundle method based on approximate subgradients

This page was built for publication: A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions