The proximal Chebychev center cutting plane algorithm for convex additive functions

DOI10.1007/S10107-012-0630-ZMaRDI QIDQ359628zbMATH OpenOpenAlexFDO

Authors 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

network flowsnondifferentiable optimizationlarge-scale convex programmingrouting problems in telecommunications

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
• A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
• A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence
• Numerical methods for nondifferentiable convex optimization
• scientific article; zbMATH DE number 1778406

Cites work

• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 4215340 (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 Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• A bundle-type algorithm for routing in telecommunication data networks
• A central cutting plane algorithm for the convex programming problem
• A new proximal decomposition algorithm for routing in telecommunication networks
• A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
• A survey of algorithms for convex multicommodity flow problems
• ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
• An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
• Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
• Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners
• Convex Analysis
• Decomposition method of descent for minimizing the sum of convex nonsmooth functions
• Generalized Bundle Methods
• Incremental subgradient methods for nondifferentiable optimization
• Incremental-like bundle methods with application to energy planning
• Mathematical models of the delay constrained routing problem
• Methods of descent for nondifferentiable optimization
• Mixed integer nonlinear programs featuring ``on/off constraints: convex analysis and applications
• Newton's method for convex programming and Tschebyscheff approximation
• On constrained optimization by adjoint based quasi-Newton methods
• Partial Proximal Minimization Algorithms for Convex Pprogramming
• Proximity control in bundle methods for convex nondifferentiable minimization
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
• Solving semidefinite quadratic problems within nonsmooth optimization algorithms
• The Cutting-Plane Method for Solving Convex Programs
• Variable metric bundle methods: From conceptual to implementable forms

Cited in

(2)

• A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence
• Bundle methods for sum-functions with ``easy components: applications to multicommodity network design

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q359628)