Efficiency of proximal bundle methods
From MaRDI portal
Recommendations
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Approximations in proximal bundle methods and decomposition of convex programs
- A proximal bundle method based on approximate subgradients
- A proximal bundle method for nonsmooth and nonconvex constrained optimization
- scientific article; zbMATH DE number 2201296
Cites work
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- A Cholesky dual method for proximal piecewise linear programming
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Approximations in proximal bundle methods and decomposition of convex programs
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Convergence of some algorithms for convex minimization
- Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization
- Methods of descent for nondifferentiable optimization
- New variants of bundle methods
- Proximal Decomposition Via Alternating Linearization
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- Proximity control in bundle methods for convex nondifferentiable minimization
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- The efficiency of ballstep subgradient level methods for convex optimization
Cited in
(20)- Survey of Bundle Methods for Nonsmooth Optimization
- Computation of approximate -points for large scale single machine scheduling problem
- Approximations in proximal bundle methods and decomposition of convex programs
- Optimal Convergence Rates for the Proximal Bundle Method
- A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes
- A bundle modification strategy for convex minimization
- Minimizing oracle-structured composite functions
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization
- Tuning strategy for the proximity parameter in convex minimization
- Constructing mixed algorithms on the basis of some bundle method
- A single cut proximal bundle method for stochastic convex composite optimization
- General Hölder smooth convergence rates follow from specialized rates assuming growth bounds
- An optimal variant of Kelley's cutting-plane method
- A version of bundle trust region method with linear programming
- Implementation of an oracle-structured bundle method for distributed optimization
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization
- Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates
- A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence
This page was built for publication: Efficiency of proximal bundle methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1573991)
