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

Ruey-Lin Sheu, S. Y. Wu, S. C. Fang

Research output: Contribution to journalArticle

6 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 languageEnglish
Pages (from-to)7-18
Number of pages12
JournalComputers and Mathematics with Applications
Volume29
Issue number8
DOIs
Publication statusPublished - 1995 Jan 1

Fingerprint

Linear Semi-infinite Programming
Interior-point Algorithm
Primal-dual
Infeasible Interior Point Method
Computational efficiency
Computational Efficiency
Linear programming

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

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 = "Ruey-Lin Sheu and Wu, {S. Y.} and Fang, {S. C.}",
year = "1995",
month = "1",
day = "1",
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",

}

A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming. / Sheu, Ruey-Lin; Wu, S. Y.; Fang, S. C.

In: Computers and Mathematics with Applications, Vol. 29, No. 8, 01.01.1995, p. 7-18.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Sheu, Ruey-Lin

AU - Wu, S. Y.

AU - Fang, S. C.

PY - 1995/1/1

Y1 - 1995/1/1

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 - http://www.scopus.com/inward/record.url?scp=0029293686&partnerID=8YFLogxK

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

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

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

M3 - Article

VL - 29

SP - 7

EP - 18

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

SN - 0898-1221

IS - 8

ER -