A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
From MaRDI portal
Recommendations
- A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- scientific article; zbMATH DE number 1488009
- Numerical methods for nondifferentiable convex optimization
- Modified cutting plane method for minimization of a convex function
Cites work
- scientific article; zbMATH DE number 2084780 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Cholesky dual method for proximal piecewise linear programming
- A Modified Linear Program for Columnar Methods in Mathematical Programming
- A Spectral Bundle Method for Semidefinite Programming
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A bundle Bregman proximal method for convex nondifferentiable minimization
- A central cutting plane algorithm for the convex programming problem
- A constraint generation algorithm for large scale linear programs using multiple-points separation
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- An aggregate subgradient method for nonsmooth convex minimization
- An approach to robust network design in telecommunications
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Convergence of some algorithms for convex minimization
- DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
- Generalized Bundle Methods
- Implementing a proximal algorithm for some nonlinear multicommodity flow problems
- Methods of descent for nondifferentiable optimization
- New variants of bundle methods
- Newton's method for convex programming and Tschebyscheff approximation
- On constrained optimization by adjoint based quasi-Newton methods
- Proximal-ACCPM: a versatile oracle based optimisation method
- Proximity control in bundle methods for convex nondifferentiable minimization
- Robust capacity assignment in telecommunications
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- The Cutting-Plane Method for Solving Convex Programs
- The traveling-salesman problem and minimum spanning trees: Part II
- Variable metric bundle methods: From conceptual to implementable forms
Cited in
(19)- Essentials of numerical nonsmooth optimization
- Target radius methods for nonsmooth convex optimization
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- Essentials of numerical nonsmooth optimization
- Improving the performance of the stochastic dual dynamic programming algorithm using Chebyshev centers
- On geometrical properties of preconditioners in IPMs for classes of block-angular problems
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Solving a continuous local access network design problem with a stabilized central column generation approach
- On the choice of explicit stabilizing terms in column generation
- Performances improvement of the column generation algorithm: application to vehicle routing problems
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- An algorithm using trust region strategy for minimization of a nondifferentiable function
- Fast proximal algorithms for nonsmooth convex optimization
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
- A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence
This page was built for publication: A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013976)
