Using an interior point method for the master problem in a decomposition approach
type: Item
instance of: scholarly article
title: Using an interior point method for the master problem in a decomposition approach
zbMATH Open document ID: 0916.90220
DOI: 10.1016/S0377-2217(96)00182-8
published in: European Journal of Operational Research
publication date: 1999-07-21T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 1255882
zbMATH Keywords: analytic center cutting plane method
zbMATH Keywords: interior point method
zbMATH Keywords: large scale nonlinear multicommodity network flow problems
zbMATH Keywords: decomposition
author: Jacek Gondzio
author: Robert Sarkissian
author: Jean-Philippe Vial
describes a project that uses: CHFACT
MaRDI profile type: Publication
cites work: Q3056948
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming
cites work: Exploiting special structure in a primal-dual path-following algorithm
cites work: Q3844775
cites work: The Decomposition Algorithm for Linear Programs
cites work: A polynomial Newton method for linear programming
cites work: A central cutting plane algorithm for the convex programming problem
cites work: Two-Metric Projection Methods for Constrained Optimization
cites work: The Evolution of the Minimum Degree Ordering Algorithm
cites work: Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm
cites work: Using central prices in the decomposition of linear programs
cites work: Q4917542
cites work: Implementing cholesky factorization for interior point methods of linear programming
cites work: Multiple centrality corrections in a primal-dual method for linear programming
cites work: Q4355914
cites work: Path-Following Methods for Linear Programming
cites work: Exploiting Special Structure in Primal Dual Interior Point Methods
cites work: Primal-dual target-following algorithms for 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: Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
cites work: Q4355913
cites work: Q3780013
Wikidata QID: Q126382742
full work available at URL: s0377-2217(96)00182-8
OpenAlex ID: W2005777078
description: scientific article; zbMATH DE number 1255882