An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
From MaRDI portal
Publication:647397
DOI10.1007/s10107-009-0327-0zbMath1271.90058OpenAlexW2025286039MaRDI QIDQ647397
Publication date: 23 November 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00208074v2/file/RR-6420.pdf
convex programmingnondifferentiable optimizationnetwork flow problemproximal bundle methodsapproximate subgradients
Numerical mathematical programming methods (65K05) Convex programming (90C25) Combinatorial optimization (90C27)
Related Items
An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems, A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator, A proximal alternating linearization method for nonconvex optimization problems, The proximal Chebychev center cutting plane algorithm for convex additive functions, A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information, A class of alternating linearization algorithms for nonsmooth convex optimization, Primal convergence from dual subgradient methods for convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximity control in bundle methods for convex nondifferentiable minimization
- An inexact bundle variant suited to column generation
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum
- A Cholesky dual method for proximal piecewise linear programming
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- A bundle-type algorithm for routing in telecommunication data networks
- A Survey of Algorithms for Convex Multicommodity Flow Problems
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- Monotone Operators and the Proximal Point Algorithm
- Proximal Decomposition Via Alternating Linearization
- Lagrangian Relaxation via Ballstep Subgradient Methods
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Convex Analysis
