Convex proximal bundle methods in depth: a unified analysis for inexact oracles

DOI10.1007/s10107-014-0809-6zbMath1327.90321OpenAlexW2031244688MaRDI QIDQ484139

Claudia A. Sagastizábal, Claude Lemaréchal, Welington de Oliveira

Publication date: 18 December 2014

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

Full work available at URL: https://doi.org/10.1007/s10107-014-0809-6

zbMATH Keywords

algorithmnoiseconvergencenonsmooth optimizationstochastic programmingconvex optimizationoraclebundle methodnoise attenuation

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

A Trust-region Method for Nonsmooth Nonconvex Optimization, A discussion of probability functions and constraints from a variational perspective, Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions, Prices stabilization for inexact unit-commitment problems, Probabilistic optimization via approximate \(p\)-efficient points and bundle methods, Uncontrolled inexact information within bundle methods, A comparison of four approaches from stochastic programming for large-scale unit-commitment, An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions, A multi-step doubly stabilized bundle method for nonsmooth convex optimization, Generalisations, examples, and counter-examples in analysis and optimisation. \textit{In honour of Michel Théra at 70}, Computing proximal points of convex functions with inexact subgradients, A method for convex minimization based on translated first-order approximations, A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems, A simple version of bundle method with linear programming, Fast bundle-level methods for unconstrained and ball-constrained convex optimization, A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information, Level bundle methods for constrained convex optimization with various oracles, Alternating forward-backward splitting for linearly constrained optimization problems, Adaptive Bundle Methods for Nonlinear Robust Optimization, New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information, Polyhedral results and stronger Lagrangean bounds for stable spanning trees, An Inner-Outer Approximation Approach to Chance Constrained Optimization, Optimal Convergence Rates for the Proximal Bundle Method, Minimizing oracle-structured composite functions, A derivative-free 𝒱𝒰-algorithm for convex finite-max problems, Incremental Bundle Methods using Upper Models, A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information, Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies, Target radius methods for nonsmooth convex optimization, Large-scale unit commitment under uncertainty: an updated literature survey, A sharp augmented Lagrangian-based method in constrained non-convex optimization, Unnamed Item, A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming, A characterization of the subdifferential of singular Gaussian distribution functions, Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs, A feasible point method with bundle modification for nonsmooth convex constrained optimization, Outer-approximation algorithms for nonsmooth convex MINLP problems, A filter proximal bundle method for nonsmooth nonconvex constrained optimization, Proximal bundle methods for nonsmooth DC programming, A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions, An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space, A strongly convergent proximal bundle method for convex minimization in Hilbert spaces, Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley, Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization, Penalized sample average approximation methods for stochastic programs in economic and secure dispatch of a power system, Regularized decomposition of large scale block-structured robust optimization problems, A proximal bundle method for nonsmooth nonconvex functions with inexact information, Essentials of numerical nonsmooth optimization, Minimizing Piecewise-Concave Functions Over Polyhedra, Convexity and optimization with copulæ structured probabilistic constraints, On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems, A new restricted memory level bundle method for constrained convex nonsmooth optimization, Revisiting augmented Lagrangian duals, A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes, Essentials of numerical nonsmooth optimization, Large-scale unit commitment under uncertainty, A doubly stabilized bundle method for nonsmooth convex optimization

Cites Work

• Unnamed Item
• Composite proximal bundle method
• On approximations with finite precision in bundle methods for nonsmooth optimization
• Incremental-like bundle methods with application to energy planning
• On the choice of explicit stabilizing terms in column generation
• Newton's method for convex programming and Tschebyscheff approximation
• Convergence of some algorithms for convex minimization
• Level bundle methods for oracles with on-demand accuracy
• Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
• The Cutting-Plane Method for Solving Convex Programs
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• The B<scp>oxstep</scp> Method for Large-Scale Optimization
• A Spectral Bundle Method for Semidefinite Programming
• Generalized Bundle Methods
• An Incremental Method for Solving Convex Finite Min-Max Problems
• A Proximal Bundle Method with Approximate Subgradient Linearizations
• A second-order bundle method to minimize the maximum eigenvalue function.
• A proximal bundle method based on approximate subgradients