Exploiting special structure in a primal-dual path-following algorithm

In Chan Choi, Donald Goldfarb

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

A primal-dual path-following algorithm that applies directly to a linear program of the form, min{ctx{divides}Ax = b, Hx ≤u, x ≥ 0, x ∈ ℝn}, is presented. This algorithm explicitly handles upper bounds, generalized upper bounds, variable upper bounds, and block diagonal structure. We also show how the structure of time-staged problems and network flow problems can be exploited, especially on a parallel computer. Finally, using our algorithm, we obtain a complexity bound of O( {Mathematical expression}ds2 log(nk)) for transportation problems with s origins, d destinations (s <d), and n arcs, where k is the maximum absolute value of the input data.

Original languageEnglish
Pages (from-to)33-52
Number of pages20
JournalMathematical Programming
Volume58
Issue number1-3
DOIs
Publication statusPublished - 1993 Jan 1
Externally publishedYes

Fingerprint

Path-following Algorithm
Primal-dual Algorithm
Upper bound
Network Flow Problem
Transportation Problem
Parallel Computers
Absolute value
Linear Program
Divides
Arc of a curve

Keywords

  • Interior point method
  • primal-dual path-following algorithm
  • structured linear programs

ASJC Scopus subject areas

  • Computer Science(all)
  • Computer Graphics and Computer-Aided Design
  • Software
  • Management Science and Operations Research
  • Safety, Risk, Reliability and Quality
  • Mathematics(all)
  • Applied Mathematics

Cite this

Exploiting special structure in a primal-dual path-following algorithm. / Choi, In Chan; Goldfarb, Donald.

In: Mathematical Programming, Vol. 58, No. 1-3, 01.01.1993, p. 33-52.

Research output: Contribution to journalArticle

@article{effbeb1c2d854058a676d9599bfde0a0,
title = "Exploiting special structure in a primal-dual path-following algorithm",
abstract = "A primal-dual path-following algorithm that applies directly to a linear program of the form, min{ctx{divides}Ax = b, Hx ≤u, x ≥ 0, x ∈ ℝn}, is presented. This algorithm explicitly handles upper bounds, generalized upper bounds, variable upper bounds, and block diagonal structure. We also show how the structure of time-staged problems and network flow problems can be exploited, especially on a parallel computer. Finally, using our algorithm, we obtain a complexity bound of O( {Mathematical expression}ds2 log(nk)) for transportation problems with s origins, d destinations (s",
keywords = "Interior point method, primal-dual path-following algorithm, structured linear programs",
author = "Choi, {In Chan} and Donald Goldfarb",
year = "1993",
month = "1",
day = "1",
doi = "10.1007/BF01581258",
language = "English",
volume = "58",
pages = "33--52",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer-Verlag GmbH and Co. KG",
number = "1-3",

}

TY - JOUR

T1 - Exploiting special structure in a primal-dual path-following algorithm

AU - Choi, In Chan

AU - Goldfarb, Donald

PY - 1993/1/1

Y1 - 1993/1/1

N2 - A primal-dual path-following algorithm that applies directly to a linear program of the form, min{ctx{divides}Ax = b, Hx ≤u, x ≥ 0, x ∈ ℝn}, is presented. This algorithm explicitly handles upper bounds, generalized upper bounds, variable upper bounds, and block diagonal structure. We also show how the structure of time-staged problems and network flow problems can be exploited, especially on a parallel computer. Finally, using our algorithm, we obtain a complexity bound of O( {Mathematical expression}ds2 log(nk)) for transportation problems with s origins, d destinations (s

AB - A primal-dual path-following algorithm that applies directly to a linear program of the form, min{ctx{divides}Ax = b, Hx ≤u, x ≥ 0, x ∈ ℝn}, is presented. This algorithm explicitly handles upper bounds, generalized upper bounds, variable upper bounds, and block diagonal structure. We also show how the structure of time-staged problems and network flow problems can be exploited, especially on a parallel computer. Finally, using our algorithm, we obtain a complexity bound of O( {Mathematical expression}ds2 log(nk)) for transportation problems with s origins, d destinations (s

KW - Interior point method

KW - primal-dual path-following algorithm

KW - structured linear programs

UR - http://www.scopus.com/inward/record.url?scp=0027911624&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027911624&partnerID=8YFLogxK

U2 - 10.1007/BF01581258

DO - 10.1007/BF01581258

M3 - Article

AN - SCOPUS:0027911624

VL - 58

SP - 33

EP - 52

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 1-3

ER -