On approximations with finite precision in bundle methods for nonsmooth optimization
From MaRDI portal
Publication:597165
DOI10.1023/B:JOTA.0000005046.70410.02zbMath1094.90046OpenAlexW2149570417MaRDI QIDQ597165
Publication date: 6 August 2004
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jota.0000005046.70410.02
Related Items (26)
An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems ⋮ Dynamic bundle methods ⋮ Level bundle methods for oracles with on-demand accuracy ⋮ Uncontrolled inexact information within bundle methods ⋮ An approximate bundle method for solving nonsmooth equilibrium problems ⋮ An approximate quasi-Newton bundle-type method for nonsmooth optimization ⋮ A proximal bundle method with inexact data for convex nondifferentiable minimization ⋮ Dual norm based iterative methods for image restoration ⋮ A simple version of bundle method with linear programming ⋮ A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ A decomposition algorithm for convex nondifferentiable minimization with errors ⋮ Optimal Convergence Rates for the Proximal Bundle Method ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ A proximal analytic center cutting plane algorithm for solving variational inequality problems ⋮ A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems ⋮ Convex proximal bundle methods in depth: a unified analysis for inexact oracles ⋮ Incremental-like bundle methods with application to energy planning ⋮ An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space ⋮ A strongly convergent proximal bundle method for convex minimization in Hilbert spaces ⋮ An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information ⋮ A proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ An approximate bundle-type auxiliary problem method for solving generalized variational inequalities ⋮ An inexact bundle variant suited to column generation ⋮ Benders decomposition with adaptive oracles for large scale optimization ⋮ A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data ⋮ A doubly stabilized bundle method for nonsmooth convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximity control in bundle methods for convex nondifferentiable minimization
- Error stability properties of generalized gradient-type algorithms
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Variable metric bundle methods: From conceptual to implementable forms
- Convergence analysis of perturbed feasible descent methods
- A family of variable metric proximal methods
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Approximations in proximal bundle methods and decomposition of convex programs
- Methods of descent for nondifferentiable optimization
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A proximal bundle method based on approximate subgradients
This page was built for publication: On approximations with finite precision in bundle methods for nonsmooth optimization
