Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
From MaRDI portal
Publication:1361108
DOI10.1007/BF02614381zbMath0881.90050OpenAlexW2045068465MaRDI QIDQ1361108
Jacek Gondzio, Robert Sarkissian, Jean-Louis Goffin, Jean-Philippe Vial
Publication date: 19 February 1998
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02614381
nondifferentiable problemspotential reduction algorithmanalytic center cutting plane methodd-heapdecomopsitionlarge scale randomly generated problemsnonlinear multicommodity flowuncapacited network
Related Items
Large-scale optimization with the primal-dual column generation method, Improving an interior-point algorithm for multicommodity flows by quadratic regularizations, Complexity of some cutting plane methods that use analytic centers, Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem, Piecewise linear approximations in nonconvex nonsmooth optimization, A bundle-type algorithm for routing in telecommunication data networks, A matrix generation approach for eigenvalue optimization, The proximal Chebychev center cutting plane algorithm for convex additive functions, An interior point cutting plane heuristic for mixed integer programming, An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems, Unnamed Item, Convexification of generalized network flow problem, Specialized fast algorithms for IQC feasibility and optimization problems., 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, Enhancing the behavior of interior-point methods via identification of variables, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Essentials of numerical nonsmooth optimization, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems, A note on some analytic center cutting plane methods for convex feasibility and minimization problems, Using an interior point method for the master problem in a decomposition approach, Chebyshev center based column generation, Warm start of the primal-dual method applied in the cutting-plane scheme, An analytic center cutting plane algorithm for finding equilibrium points, Primal convergence from dual subgradient methods for convex optimization, Essentials of numerical nonsmooth optimization, Benchmarking interior point Lp/Qp solvers, A heuristic for the continuous capacity and flow assignment, About Lagrangian methods in integer optimization
Uses Software
Cites Work
- Using central prices in the decomposition of linear programs
- Benders decomposition for variational inequalities
- A new polynomial-time algorithm for linear programming
- Proximity control in bundle methods for convex nondifferentiable minimization
- A polynomial Newton method for linear programming
- Solving combinatorial optimization problems using Karmarkar's algorithm
- A weighted least squares study of robustness in interior point linear programming
- Multicommodity network flows: The impact of formulation on decomposition
- 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
- Manifestations of the Schur complement
- A cutting plane algorithm for convex programming that uses analytic centers
- A cutting plane method from analytic centers for stochastic programming
- New variants of bundle methods
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Methods of descent for nondifferentiable optimization
- Two-Metric Projection Methods for Constrained Optimization
- The Cutting-Plane Method for Solving Convex Programs
- The Decomposition Algorithm for Linear Programs
- Restricted simplicial decomposition: Computation and extensions
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Path-Following Methods for Linear Programming
- A Potential Reduction Algorithm Allowing Column Generation
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
- Sparse Matrix Methods in Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
