A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming

R. L. Sheu; S. Y. Wu; S. C. Fang

doi:10.1016/0898-1221(95)00025-T

A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming

R. L. Sheu
, S. Y. Wu
, S. C. Fang

Department of Mathematics

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

7 Citations (Scopus)

Abstract

In this paper, we design an algorithm for solving linear semi-infinite programming problems by using the recently developed primal-dual infeasible-interior-point method for linear programming. The proposed algorithm enjoys the advantages of having "multiple inexactness" and "warm start" for computational efficiency. A convergence proof is included.

Original language	English
Pages (from-to)	7-18
Number of pages	12
Journal	Computers and Mathematics with Applications
Volume	29
Issue number	8
DOIs	https://doi.org/10.1016/0898-1221(95)00025-T
Publication status	Published - 1995 Apr

All Science Journal Classification (ASJC) codes

Modelling and Simulation
Computational Theory and Mathematics
Computational Mathematics

Access to Document

10.1016/0898-1221(95)00025-T

Cite this

@article{3d0ff66c346e4ccf85dba2da5feda026,

title = "A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming",

abstract = "In this paper, we design an algorithm for solving linear semi-infinite programming problems by using the recently developed primal-dual infeasible-interior-point method for linear programming. The proposed algorithm enjoys the advantages of having {"}multiple inexactness{"} and {"}warm start{"} for computational efficiency. A convergence proof is included.",

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

note = "Funding Information: *Partially supported by the North Carolina Supercomputing Center 1994 Cray Research Award.",

year = "1995",

month = apr,

doi = "10.1016/0898-1221(95)00025-T",

language = "English",

volume = "29",

pages = "7--18",

journal = "Computers and Mathematics with Applications",

issn = "0898-1221",

publisher = "Elsevier Limited",

number = "8",

}

TY - JOUR

T1 - A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming

AU - Sheu, R. L.

AU - Wu, S. Y.

AU - Fang, S. C.

N1 - Funding Information: *Partially supported by the North Carolina Supercomputing Center 1994 Cray Research Award.

PY - 1995/4

Y1 - 1995/4

N2 - In this paper, we design an algorithm for solving linear semi-infinite programming problems by using the recently developed primal-dual infeasible-interior-point method for linear programming. The proposed algorithm enjoys the advantages of having "multiple inexactness" and "warm start" for computational efficiency. A convergence proof is included.

AB - In this paper, we design an algorithm for solving linear semi-infinite programming problems by using the recently developed primal-dual infeasible-interior-point method for linear programming. The proposed algorithm enjoys the advantages of having "multiple inexactness" and "warm start" for computational efficiency. A convergence proof is included.

UR - https://www.scopus.com/pages/publications/0029293686

UR - https://www.scopus.com/pages/publications/0029293686#tab=citedBy

U2 - 10.1016/0898-1221(95)00025-T

DO - 10.1016/0898-1221(95)00025-T

M3 - Article

AN - SCOPUS:0029293686

SN - 0898-1221

VL - 29

SP - 7

EP - 18

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

IS - 8

ER -

A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this