An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
DOI10.1007/S10107-009-0327-0zbMATH Open1271.90058OpenAlexW2025286039MaRDI QIDQ647397FDOQ647397
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
Recommendations
- 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
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- On methods for the convex multi-commodity flow problem
convex programmingnondifferentiable optimizationproximal bundle methodsnetwork flow problemapproximate subgradients
Numerical mathematical programming methods (65K05) Convex programming (90C25) Combinatorial optimization (90C27)
Cites Work
- Convex Analysis
- Monotone Operators and the Proximal Point Algorithm
- Title not available (Why is that?)
- Proximity control in bundle methods for convex nondifferentiable minimization
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- A bundle-type algorithm for routing in telecommunication data networks
- A Survey of Algorithms for Convex Multicommodity Flow Problems
- Title not available (Why is that?)
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Proximal Decomposition Via Alternating Linearization
- An inexact bundle variant suited to column generation
- A Cholesky dual method for proximal piecewise linear programming
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- Title not available (Why is that?)
- Lagrangian Relaxation via Ballstep Subgradient Methods
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
Cited In (12)
- 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
- Proximal decomposition of convex optimization via an alternating linearization algorithm with inexact oracles
- 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
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- A proximal alternating linearization method for nonconvex optimization problems
- Title not available (Why is that?)
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
This page was built for publication: An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647397)
