ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
From MaRDI portal
(Redirected from Publication:1016355)
Recommendations
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- A computationally efficient method for nonlinear multicommodity network flow problems
- A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
- Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
Cites work
- scientific article; zbMATH DE number 4215340 (Why is no real title available?)
- scientific article; zbMATH DE number 3526459 (Why is no real title available?)
- scientific article; zbMATH DE number 3431955 (Why is no real title available?)
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A new proximal decomposition algorithm for routing in telecommunication networks
- A note on two problems in connexion with graphs
- A survey of algorithms for convex multicommodity flow problems
- An augmented Lagrangian algorithm for large scale multicommodity routing
- Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
- Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
- Improving complexity of structured convex optimization problems using self-concordant barriers
- Introductory lectures on convex optimization. A basic course.
- Nondifferentiable optimization and polynomial problems
- On the convergence of descent methods for monotone variational inequalities
- Origin-Based Algorithm for the Traffic Assignment Problem
- Progress Made in Solving the Multicommodity Flow Problem
- Projected Newton methods and optimization of multicommodity flows
- Smooth minimization of non-smooth functions
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- 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
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
Cited in
(15)- Large-scale optimization with the primal-dual column generation method
- The omnipresence of Lagrange
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- A conic quadratic formulation for a class of convex congestion functions in network flow problems
- On geometrical properties of preconditioners in IPMs for classes of block-angular problems
- 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
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- A bundle-type algorithm for routing in telecommunication data networks
- Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
- A partitioning algorithm for the network loading problem
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- 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
This page was built for publication: ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1016355)
