On the generalized path-following methods for linear programming

R. L. Sheu; S. C. Fang

doi:10.1080/02331939408843987

On the generalized path-following methods for linear programming

R. L. Sheu, S. C. Fang

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

In this paper, we study a general path-following model for linear programming. Generalized barrier functions for linear programming are defined to create an ideal interior trajectory for path-following. The key components required for a generic algorithm, including the moving directions and criterion of closeness are discussed. A generic path-following algorithm is proposed and sufficient conditions for convergence and polynomality proofs are derived.

Original language	English
Pages (from-to)	235-249
Number of pages	15
Journal	Optimization
Volume	30
Issue number	3
DOIs	https://doi.org/10.1080/02331939408843987
Publication status	Published - 1994 Jan 1

All Science Journal Classification (ASJC) codes

Control and Optimization
Management Science and Operations Research
Applied Mathematics

Access to Document

10.1080/02331939408843987

Cite this

@article{542623278ac9425890de8fff754248a2,

title = "On the generalized path-following methods for linear programming",

abstract = "In this paper, we study a general path-following model for linear programming. Generalized barrier functions for linear programming are defined to create an ideal interior trajectory for path-following. The key components required for a generic algorithm, including the moving directions and criterion of closeness are discussed. A generic path-following algorithm is proposed and sufficient conditions for convergence and polynomality proofs are derived.",

author = "Sheu, {R. L.} and Fang, {S. C.}",

note = "Funding Information: * This work is partially supported by the North Carolina Supercomputing Center 1992 Cray Grant Program sponsored by Cray Research. ** Also partially sponsored by the National Science Council Research Grant # NSC 81-0415-E-007-10 of the Republic of China.",

year = "1994",

month = jan,

day = "1",

doi = "10.1080/02331939408843987",

language = "English",

volume = "30",

pages = "235--249",

journal = "Optimization",

issn = "0233-1934",

publisher = "Taylor and Francis Ltd.",

number = "3",

}

TY - JOUR

T1 - On the generalized path-following methods for linear programming

AU - Sheu, R. L.

AU - Fang, S. C.

N1 - Funding Information: * This work is partially supported by the North Carolina Supercomputing Center 1992 Cray Grant Program sponsored by Cray Research. ** Also partially sponsored by the National Science Council Research Grant # NSC 81-0415-E-007-10 of the Republic of China.

PY - 1994/1/1

Y1 - 1994/1/1

N2 - In this paper, we study a general path-following model for linear programming. Generalized barrier functions for linear programming are defined to create an ideal interior trajectory for path-following. The key components required for a generic algorithm, including the moving directions and criterion of closeness are discussed. A generic path-following algorithm is proposed and sufficient conditions for convergence and polynomality proofs are derived.

AB - In this paper, we study a general path-following model for linear programming. Generalized barrier functions for linear programming are defined to create an ideal interior trajectory for path-following. The key components required for a generic algorithm, including the moving directions and criterion of closeness are discussed. A generic path-following algorithm is proposed and sufficient conditions for convergence and polynomality proofs are derived.

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

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

U2 - 10.1080/02331939408843987

DO - 10.1080/02331939408843987

M3 - Article

AN - SCOPUS:0009181597

VL - 30

SP - 235

EP - 249

JO - Optimization

JF - Optimization

SN - 0233-1934

IS - 3

ER -

On the generalized path-following methods for linear programming

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this