A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
From MaRDI portal
Publication:1013976
DOI10.1007/s10107-008-0209-xzbMath1173.90009OpenAlexW2128352390MaRDI QIDQ1013976
Publication date: 24 April 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0209-x
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Related Items
Improving the performance of the stochastic dual dynamic programming algorithm using Chebyshev centers ⋮ The proximal Chebychev center cutting plane algorithm for convex additive functions ⋮ Fast proximal algorithms for nonsmooth convex optimization ⋮ Implementing the simplex method as a cutting-plane method, with a view to regularization ⋮ On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems ⋮ Fast bundle-level methods for unconstrained and ball-constrained convex optimization ⋮ Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods ⋮ On the computational efficiency of subgradient methods: a case study with Lagrangian bounds ⋮ Solving a continuous local access network design problem with a stabilized central column generation approach ⋮ A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence ⋮ Target radius methods for nonsmooth convex optimization ⋮ Bundle methods for sum-functions with ``easy components: applications to multicommodity network design ⋮ Performances improvement of the column generation algorithm: application to vehicle routing problems ⋮ Essentials of numerical nonsmooth optimization ⋮ A proximal cutting plane method using Chebychev center for nonsmooth convex optimization ⋮ On the choice of explicit stabilizing terms in column generation ⋮ An Algorithm Using Trust Region Strategy for Minimization of a Nondifferentiable Function ⋮ Essentials of numerical nonsmooth optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust capacity assignment in telecommunications
- Proximity control in bundle methods for convex nondifferentiable minimization
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- Newton's method for convex programming and Tschebyscheff approximation
- A bundle Bregman proximal method for convex nondifferentiable minimization
- Convergence of some algorithms for convex minimization
- A Cholesky dual method for proximal piecewise linear programming
- Variable metric bundle methods: From conceptual to implementable forms
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- New variants of bundle methods
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Methods of descent for nondifferentiable optimization
- A constraint generation algorithm for large scale linear programs using multiple-points separation
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- An aggregate subgradient method for nonsmooth convex minimization
- The Cutting-Plane Method for Solving Convex Programs
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Implementing a proximal algorithm for some nonlinear multicommodity flow problems
- An approach to robust network design in telecommunications
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A central cutting plane algorithm for the convex programming problem
- On constrained optimization by adjoint based quasi-Newton methods
- A Spectral Bundle Method for Semidefinite Programming
- DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
- Generalized Bundle Methods
- A Modified Linear Program for Columnar Methods in Mathematical Programming
- The traveling-salesman problem and minimum spanning trees: Part II
