A bundle-type algorithm for routing in telecommunication data networks
From MaRDI portal
Publication:2655403
DOI10.1007/S10589-007-9160-7zbMATH Open1181.90059OpenAlexW2062260435MaRDI QIDQ2655403FDOQ2655403
Authors: 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
Recommendations
Cites Work
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Generalized Bundle Methods
- 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
- 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
- A survey of algorithms for convex multicommodity flow problems
- The Cutting-Plane Method for Solving Convex Programs
- Title not available (Why is that?)
- Two-Metric Projection Methods for Constrained Optimization
- Newton's method for convex programming and Tschebyscheff approximation
- An Interior Point Method for Block Angular Optimization
- A Cholesky dual method for proximal piecewise linear programming
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Title not available (Why is that?)
- A new proximal decomposition algorithm for routing in telecommunication networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lagrangian Relaxation via Ballstep Subgradient Methods
- The flow deviation method: An approach to store‐and‐forward communication network design
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
- Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
- A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
Cited In (13)
- Title not available (Why is that?)
- Approximated perspective relaxations: a project and lift approach
- Large-scale optimization with the primal-dual column generation method
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
- The omnipresence of Lagrange
- Application of Lagrangian relaxation to computer network control
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- Models for the piecewise linear unsplittable multicommodity flow problems
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Implementation of an oracle-structured bundle method for distributed optimization
- Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- A decomposition method for solving multicommodity network equilibria
This page was built for publication: A bundle-type algorithm for routing in telecommunication data networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2655403)
