The proximal Chebychev center cutting plane algorithm for convex additive functions

DOI10.1007/s10107-012-0630-zzbMath1292.90285OpenAlexW2057698180MaRDI QIDQ359628

Adam Ouorou

Publication date: 12 August 2013

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

Full work available at URL: https://doi.org/10.1007/s10107-012-0630-z

zbMATH Keywords

nondifferentiable optimizationnetwork flowslarge-scale convex programmingrouting problems in telecommunications

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (1)

Bundle methods for sum-functions with ``easy components: applications to multicommodity network design

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
• Proximity control in bundle methods for convex nondifferentiable minimization
• Incremental-like bundle methods with application to energy planning
• A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
• ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
• Decomposition method of descent for minimizing the sum of convex nonsmooth functions
• Newton's method for convex programming and Tschebyscheff approximation
• A Cholesky dual method for proximal piecewise linear programming
• Variable metric bundle methods: From conceptual to implementable forms
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
• Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
• Methods of descent for nondifferentiable optimization
• Solving semidefinite quadratic problems within nonsmooth optimization algorithms
• A bundle-type algorithm for routing in telecommunication data networks
• Incremental Subgradient Methods for Nondifferentiable Optimization
• A Survey of Algorithms for Convex Multicommodity Flow Problems
• The Cutting-Plane Method for Solving Convex Programs
• 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
• Partial Proximal Minimization Algorithms for Convex Pprogramming
• On constrained optimization by adjoint based quasi-Newton methods
• A new proximal decomposition algorithm for routing in telecommunication networks
• Generalized Bundle Methods
• Convex Analysis
• Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners

This page was built for publication: The proximal Chebychev center cutting plane algorithm for convex additive functions