Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
From MaRDI portal
Recommendations
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
- A computationally efficient method for nonlinear multicommodity network flow problems
- A separable nonlinear model for the multicommodity flow problem
- Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm
Cites work
- A cutting plane algorithm for convex programming that uses analytic centers
- A cutting plane method from analytic centers for stochastic programming
- A new polynomial-time algorithm for linear programming
- A polynomial Newton method for linear programming
- A Potential Reduction Algorithm Allowing Column Generation
- A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A weighted least squares study of robustness in interior point linear programming
- Benders decomposition for variational inequalities
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- Exploiting special structure in a primal-dual path-following algorithm
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3972625 (Why is no real title available?)
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 679864 (Why is no real title available?)
- scientific article; zbMATH DE number 1064583 (Why is no real title available?)
- scientific article; zbMATH DE number 781814 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- Manifestations of the Schur complement
- Methods of descent for nondifferentiable optimization
- Multicommodity network flows: The impact of formulation on decomposition
- Network flows. Theory, algorithms, and applications.
- New variants of bundle methods
- Path-Following Methods for Linear Programming
- Proximity control in bundle methods for convex nondifferentiable minimization
- Restricted simplicial decomposition: Computation and extensions
- Solving combinatorial optimization problems using Karmarkar's algorithm
- Sparse Matrix Methods in Optimization
- The Cutting-Plane Method for Solving Convex Programs
- The Decomposition Algorithm for Linear Programs
- Two-Metric Projection Methods for Constrained Optimization
- Using central prices in the decomposition of linear programs
Cited in
(37)- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- Using an interior point method for the master problem in a decomposition approach
- Warm start of the primal-dual method applied in the cutting-plane scheme
- Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems
- Complexity of some cutting plane methods that use analytic centers
- Specialized fast algorithms for IQC feasibility and optimization problems.
- Convexification of generalized network flow problem
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems
- A heuristic for the continuous capacity and flow assignment
- Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- Primal convergence from dual subgradient methods for convex optimization
- Piecewise linear approximations in nonconvex nonsmooth optimization
- A bundle-type algorithm for routing in telecommunication data networks
- Large-scale optimization with the primal-dual column generation method
- A separable nonlinear model for the multicommodity flow problem
- Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
- A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
- An analytic center cutting plane algorithm for finding equilibrium points
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
- A computationally efficient method for nonlinear multicommodity network flow problems
- Benchmarking interior point Lp/Qp solvers
- Multicommodity network flows: A survey. II: Solution methods
- Enhancing the behavior of interior-point methods via identification of variables
- Essentials of numerical nonsmooth optimization
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Essentials of numerical nonsmooth optimization
- An interior point cutting plane heuristic for mixed integer programming
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- Sensitivity analysis in Dantzig–Wolfe decomposition
- Chebyshev center based column generation
- About Lagrangian methods in integer optimization
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
- A matrix generation approach for eigenvalue optimization
This page was built for publication: Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361108)
