A bundle-type algorithm for routing in telecommunication data networks
From MaRDI portal
Publication:2655403
DOI10.1007/s10589-007-9160-7zbMath1181.90059OpenAlexW2062260435MaRDI QIDQ2655403
Adam Ouorou, Georgios Petrou, Claude Lemaréchal
Publication date: 25 January 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.6324
Related Items
Large-scale optimization with the primal-dual column generation method ⋮ Improving an interior-point algorithm for multicommodity flows by quadratic regularizations ⋮ Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem ⋮ The proximal Chebychev center cutting plane algorithm for convex additive functions ⋮ A decomposition method for solving multicommodity network equilibria ⋮ 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 ⋮ Models for the piecewise linear unsplittable multicommodity flow problems ⋮ The omnipresence of Lagrange ⋮ Approximated perspective relaxations: a project and lift approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- 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
- New variants of bundle methods
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- A Survey of Algorithms for Convex Multicommodity Flow Problems
- Two-Metric Projection Methods for Constrained Optimization
- The Cutting-Plane Method for Solving Convex Programs
- A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
- An Interior Point Method for Block Angular Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
- A new proximal decomposition algorithm for routing in telecommunication networks
- Generalized Bundle Methods
- Lagrangian Relaxation via Ballstep Subgradient Methods
- The flow deviation method: An approach to store‐and‐forward communication network design
