A proximal bundle method with inexact data for convex nondifferentiable minimization
From MaRDI portal
Publication:876907
DOI10.1016/j.na.2006.02.039zbMath1110.49030MaRDI QIDQ876907
Li-Ping Pang, Jie Shen, Zun-Quan Xia
Publication date: 19 April 2007
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2006.02.039
nonsmooth optimization; convex optimization; nonlinear programming; approximate subgradient; proximal bundle method; bundle method
90C25: Convex programming
90C30: Nonlinear programming
90C20: Quadratic programming
49J52: Nonsmooth analysis
49M37: Numerical methods based on nonlinear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On approximations with finite precision in bundle methods for nonsmooth optimization
- Numerical optimization. Theoretical and practice aspects
- Methods of descent for nondifferentiable optimization
- An Algorithm for Nonsmooth Convex Minimization With Errors
- A proximal bundle method based on approximate subgradients