A bundle-type algorithm for routing in telecommunication data networks
From MaRDI portal
Publication:2655403
Recommendations
Cites work
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 3871040 (Why is no real title available?)
- scientific article; zbMATH DE number 3526459 (Why is no real title available?)
- scientific article; zbMATH DE number 2084780 (Why is no real title available?)
- A Cholesky dual method for proximal piecewise linear programming
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
- A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A new proximal decomposition algorithm for routing in telecommunication networks
- 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 Interior Point Method for Block Angular Optimization
- Generalized Bundle Methods
- Lagrangian Relaxation via Ballstep Subgradient Methods
- New variants of bundle methods
- Newton's method for convex programming and Tschebyscheff approximation
- Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
- 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
- The flow deviation method: An approach to store‐and‐forward communication network design
- Two-Metric Projection Methods for Constrained Optimization
- Variable metric bundle methods: From conceptual to implementable forms
Cited in
(13)- scientific article; zbMATH DE number 5585902 (Why is no real title available?)
- 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)
