Variable metric bundle methods: From conceptual to implementable forms

DOI10.1007/BF02614390zbMath0872.90072OpenAlexW1978669994MaRDI QIDQ1356052

Claude Lemaréchal, Claudia A. Sagastizábal

Publication date: 15 October 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02614390

zbMATH Keywords

convergence resultsbundle methodproximal pointbundling mechanismsMoreau-Yosida regularizationsquasi-Newton matrices

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Related Items (60)

A method for nonsmooth optimization problems ⋮ A method for non-differentiable optimization problems ⋮ A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator ⋮ Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization ⋮ On Lipschitz optimization based on gray-box piecewise linearization ⋮ Survey of Bundle Methods for Nonsmooth Optimization ⋮ DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS ⋮ The developments of proximal point algorithms ⋮ An optimal variant of Kelley's cutting-plane method ⋮ Level bundle methods for oracles with on-demand accuracy ⋮ A bundle-type algorithm for routing in telecommunication data networks ⋮ A bundle modification strategy for convex minimization ⋮ The proximal Chebychev center cutting plane algorithm for convex additive functions ⋮ Fast Moreau envelope computation I: Numerical algorithms ⋮ On approximations with finite precision in bundle methods for nonsmooth optimization ⋮ A multi-step doubly stabilized bundle method for nonsmooth convex optimization ⋮ Computing proximal points of convex functions with inexact subgradients ⋮ Approximately solving multi-valued variational inequalities by using a projection and contraction algorithm ⋮ Descentwise inexact proximal algorithms for smooth optimization ⋮ A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective ⋮ Numerical infinitesimals in a variable metric method for convex nonsmooth optimization ⋮ Optimal Convergence Rates for the Proximal Bundle Method ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ Minimizing oracle-structured composite functions ⋮ An additive subfamily of enlargements of a maximally monotone operator ⋮ Efficient first-order methods for convex minimization: a constructive approach ⋮ Spectral projected subgradient method for nonsmooth convex optimization problems ⋮ On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization ⋮ Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs ⋮ Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment ⋮ Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem ⋮ A feasible point method with bundle modification for nonsmooth convex constrained optimization ⋮ Comparison of bundle and classical column generation ⋮ Computing proximal points of nonconvex functions ⋮ A bundle-filter method for nonsmooth convex constrained optimization ⋮ An inexact spectral bundle method for convex quadratic semidefinite programming ⋮ Incremental-like bundle methods with application to energy planning ⋮ Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions ⋮ On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs ⋮ Divide to conquer: decomposition methods for energy optimization ⋮ Multiplier stabilization applied to two-stage stochastic programs ⋮ The omnipresence of Lagrange ⋮ A quasi-Newton method for unconstrained non-smooth problems ⋮ Essentials of numerical nonsmooth optimization ⋮ Robust mid-term power generation management ⋮ Globally convergent variable metric method for convex nonsmooth unconstrained minimization ⋮ A proximal cutting plane method using Chebychev center for nonsmooth convex optimization ⋮ Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming ⋮ Partial proximal point method for nonmonotone equilibrium problems ⋮ An algorithm for nonsmooth optimization by successive piecewise linearization ⋮ Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise ⋮ Globally convergent BFGS method for nonsmooth convex optimization ⋮ Variable metric forward–backward splitting with applications to monotone inclusions in duality ⋮ A primal-proximal heuristic applied to the French unit-commitment problem ⋮ A Variable Metric Extension of the Forward–Backward–Forward Algorithm for Monotone Operators ⋮ A \(\mathcal{VU}\)-algorithm for convex minimization ⋮ A splitting algorithm for coupled system of primal-dual monotone inclusions ⋮ Essentials of numerical nonsmooth optimization ⋮ An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems ⋮ A doubly stabilized bundle method for nonsmooth convex optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proximity control in bundle methods for convex nondifferentiable minimization
• Newton's method for convex programming and Tschebyscheff approximation
• Convergence of some algorithms for convex minimization
• A quasi-second-order proximal bundle algorithm
• A note on locally Lipschitzian functions
• The Cutting-Plane Method for Solving Convex Programs
• A descent algorithm for nonsmooth convex optimization
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• Quasi-Newton Methods, Motivation and Theory
• Monotone Operators and the Proximal Point Algorithm
• Semismooth and Semiconvex Functions in Constrained Optimization
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
• Numerical methods for nondifferentiable convex optimization
• Proximité et dualité dans un espace hilbertien

This page was built for publication: Variable metric bundle methods: From conceptual to implementable forms