A proximal bundle method with inexact data for convex nondifferentiable minimization

DOI10.1016/j.na.2006.02.039zbMath1110.49030OpenAlexW2053457645MaRDI QIDQ876907

Zun-Quan Xia, Jie Shen, Li-Ping Pang

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

zbMATH Keywords

nonsmooth optimizationconvex optimizationnonlinear programmingapproximate subgradientproximal bundle methodbundle method

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20) Nonsmooth analysis (49J52) Numerical methods based on nonlinear programming (49M37)

Related Items (7)

An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions ⋮ Computing proximal points of convex functions with inexact subgradients ⋮ Alternating forward-backward splitting for linearly constrained optimization problems ⋮ A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence ⋮ A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming ⋮ Derivative-free optimization via proximal point methods ⋮ A Redistributed Bundle Algorithm for Generalized Variational Inequality Problems in Hilbert Spaces

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A proximal bundle method with inexact data for convex nondifferentiable minimization