Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
From MaRDI portal
Publication:4389206
DOI10.1137/S1052623496303329zbMath0927.65074MaRDI QIDQ4389206
Liqun Qi, Defeng Sun, Robert Mifflin
Publication date: 12 May 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
superlinear convergence; quasi-Newton method; Moreau-Yosida regularization; bundle method; nondifferentiable convex programming
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C53: Methods of quasi-Newton type
52A41: Convex functions and convex programs in convex geometry
Related Items
A Parametric Newton Method for Optimization Problems in Hilbert Spaces, A Method for Minimization of Quasidifferentiable Functions, Minimizing and stationary sequences of convex constrained minimization problems, New bundle methods for solving Lagrangian relaxation dual problems, A bundle modification strategy for convex minimization, Fast Moreau envelope computation I: Numerical algorithms, A quasi-Newton bundle method based on approximate subgradients, Globally convergent BFGS method for nonsmooth convex optimization, Tuning strategy for the proximity parameter in convex minimization, A \(\mathcal{VU}\)-algorithm for convex minimization