Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
type: Item
instance of: scholarly article
title: Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
zbMATH Open document ID: 0881.90050
DOI: 10.1007/BF02614381
published in: Mathematical Programming. Series A. Series B
publication date: 1998-02-19T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1038506
zbMATH Keywords: analytic center cutting plane method
zbMATH Keywords: nonlinear multicommodity flow
zbMATH Keywords: decomopsition
zbMATH Keywords: potential reduction algorithm
zbMATH Keywords: uncapacited network
zbMATH Keywords: d-heap
zbMATH Keywords: nondifferentiable problems
zbMATH Keywords: large scale randomly generated problems
author: Jean-Louis Goffin
author: Jacek Gondzio
author: Robert Sarkissian
author: Jean-Philippe Vial
describes a project that uses: LAPACK
MaRDI profile type: Publication
cites work: Q3056948
cites work: Q4841244
cites work: A cutting plane algorithm for convex programming that uses analytic centers
cites work: Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
cites work: A cutting plane method from analytic centers for stochastic programming
cites work: Exploiting special structure in a primal-dual path-following algorithm
cites work: Manifestations of the Schur complement
cites work: The Decomposition Algorithm for Linear Programs
cites work: A polynomial Newton method for linear programming
cites work: Q3740904
cites work: A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
cites work: Two-Metric Projection Methods for Constrained Optimization
cites work: Sparse Matrix Methods in Optimization
cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm
cites work: Using central prices in the decomposition of linear programs
cites work: Q4311911
cites work: Q3359644
cites work: Q4355914
cites work: Path-Following Methods for Linear Programming
cites work: Benders decomposition for variational inequalities
cites work: Restricted simplicial decomposition: Computation and extensions
cites work: A weighted least squares study of robustness in interior point linear programming
cites work: Multicommodity network flows: The impact of formulation on decomposition
cites work: A new polynomial-time algorithm for linear programming
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Methods of descent for nondifferentiable optimization
cites work: Proximity control in bundle methods for convex nondifferentiable minimization
cites work: Q5630824
cites work: New variants of bundle methods
cites work: Q3738922
cites work: Solving combinatorial optimization problems using Karmarkar's algorithm
cites work: Complexity estimates of some cutting plane methods based on the analytic barrier
cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
cites work: A Potential Reduction Algorithm Allowing Column Generation
full work available at URL: https://doi.org/10.1007/bf02614381
OpenAlex ID: W2045068465
description: scientific article; zbMATH DE number 1038506