A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
type: Item
instance of: scholarly article
title: A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
zbMATH Open document ID: 1173.90009
author: Adam Ouorou
published in: Mathematical Programming. Series A. Series B
publication date: 2009-04-24T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 5547237
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: subgradient
zbMATH Keywords: proximal bundle methods
zbMATH Keywords: convex programming
MaRDI profile type: Publication
full work available at URL: s10107-008-0209-x
OpenAlex ID: W2128352390
cites work: Q5297402
cites work: A constraint generation algorithm for large scale linear programs using multiple-points separation
cites work: Acceleration of cutting-plane and column generation algorithms: Applications to network design
cites work: An accelerated central cutting plane algorithm for linear semi-infinite programming
cites work: Q4821526
cites work: Convergence of some algorithms for convex minimization
cites work: Newton's method for convex programming and Tschebyscheff approximation
cites work: A central cutting plane algorithm for the convex programming problem
cites work: Solving semidefinite quadratic problems within nonsmooth optimization algorithms
cites work: Generalized Bundle Methods
cites work: On constrained optimization by adjoint based quasi-Newton methods
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: A Spectral Bundle Method for Semidefinite Programming
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: An aggregate subgradient method for nonsmooth convex minimization
cites work: Methods of descent for nondifferentiable optimization
cites work: Proximity control in bundle methods for convex nondifferentiable minimization
cites work: A Cholesky dual method for proximal piecewise linear programming
cites work: A bundle Bregman proximal method for convex nondifferentiable minimization
cites work: New variants of bundle methods
cites work: Variable metric bundle methods: From conceptual to implementable forms
cites work: Q4735938
cites work: A Modified Linear Program for Columnar Methods in Mathematical Programming
cites work: Complexity estimates of some cutting plane methods based on the analytic barrier
cites work: Robust capacity assignment in telecommunications
cites work: Implementing a proximal algorithm for some nonlinear multicommodity flow problems
cites work: An approach to robust network design in telecommunications
cites work: DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
DOI: 10.1007/S10107-008-0209-X
description: scientific article; zbMATH DE number 5547237