ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
From MaRDI portal
Publication:1016355
DOI10.1007/s10107-007-0151-3zbMath1169.90023OpenAlexW2052510704MaRDI QIDQ1016355
Jean-Philippe Vial, Frédéric Babonneau
Publication date: 5 May 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://archive-ouverte.unige.ch/unige:111375
Related Items
Large-scale optimization with the primal-dual column generation method, Improving an interior-point algorithm for multicommodity flows by quadratic regularizations, A partitioning algorithm for the network loading problem, A bundle-type algorithm for routing in telecommunication data networks, The proximal Chebychev center cutting plane algorithm for convex additive functions, On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems, 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, A conic quadratic formulation for a class of convex congestion functions in network flow problems, The omnipresence of Lagrange, ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum, Design and implementation of a modular interior-point solver for linear optimization, A twist on SLP algorithms for NLP and MINLP problems: an application to gas transmission networks, Primal convergence from dual subgradient methods for convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Smooth minimization of non-smooth functions
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Nondifferentiable optimization and polynomial problems
- Introductory lectures on convex optimization. A basic course.
- An augmented Lagrangian algorithm for large scale multicommodity routing
- Improving complexity of structured convex optimization problems using self-concordant barriers
- On the convergence of descent methods for monotone variational inequalities
- Projected Newton methods and optimization of multicommodity flows
- A Survey of Algorithms for Convex Multicommodity Flow Problems
- Two-Metric Projection Methods for Constrained Optimization
- The Cutting-Plane Method for Solving Convex Programs
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
- Progress Made in Solving the Multicommodity Flow Problem
- Origin-Based Algorithm for the Traffic Assignment Problem
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A new proximal decomposition algorithm for routing in telecommunication networks
- Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
- The flow deviation method: An approach to store‐and‐forward communication network design
