Discussion: [On self-regular IPMs, Salahi, M et al.]

Tibor Illés

doi:10.1007/BF02578958

Discussion: [On self-regular IPMs, Salahi, M et al.]

Tibor Illés

Management Science

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

Abstract

Since the 1970's, one of the most intriguing research question in linear optimization (LO) has been the the following: is there an algorithm which solves
any LO problem in polynomiM (or strongly polynomiM) number of iteration, i.e.,
the complexity of the algorithm is O(p(n, L)) (or O(p(~))), where p is a polynomial of finite degree, n is the number of variables and L is the input size of the LO problem.

Original language	English
Pages (from-to)	277-281
Number of pages	5
Journal	TOP: Transactions in Operations Research
Volume	12
Issue number	2
DOIs	https://doi.org/10.1007/BF02578958
Publication status	Published - 1 Dec 2004

Keywords

linear optimization
IPMs
polynomial
algorithm

Access to Document

10.1007/BF02578958

Cite this

@article{b31551c352f24d70bfdf15d8dc717221,

title = "Discussion: [On self-regular IPMs, Salahi, M et al.]",

abstract = "Since the 1970's, one of the most intriguing research question in linear optimization (LO) has been the the following: is there an algorithm which solves any LO problem in polynomiM (or strongly polynomiM) number of iteration, i.e., the complexity of the algorithm is O(p(n, L)) (or O(p(\textasciitilde{}))), where p is a polynomial of finite degree, n is the number of variables and L is the input size of the LO problem. ",

keywords = "linear optimization, IPMs, polynomial, algorithm",

author = "Tibor Ill{\'e}s",

year = "2004",

month = dec,

day = "1",

doi = "10.1007/BF02578958",

language = "English",

volume = "12",

pages = "277--281",

journal = "TOP: Transactions in Operations Research",

issn = "1134-5764",

publisher = "Springer Nature",

number = "2",

}

TY - JOUR

T1 - Discussion

T2 - [On self-regular IPMs, Salahi, M et al.]

AU - Illés, Tibor

PY - 2004/12/1

Y1 - 2004/12/1

N2 - Since the 1970's, one of the most intriguing research question in linear optimization (LO) has been the the following: is there an algorithm which solves any LO problem in polynomiM (or strongly polynomiM) number of iteration, i.e., the complexity of the algorithm is O(p(n, L)) (or O(p(~))), where p is a polynomial of finite degree, n is the number of variables and L is the input size of the LO problem.

AB - Since the 1970's, one of the most intriguing research question in linear optimization (LO) has been the the following: is there an algorithm which solves any LO problem in polynomiM (or strongly polynomiM) number of iteration, i.e., the complexity of the algorithm is O(p(n, L)) (or O(p(~))), where p is a polynomial of finite degree, n is the number of variables and L is the input size of the LO problem.

KW - linear optimization

KW - IPMs

KW - polynomial

KW - algorithm

U2 - 10.1007/BF02578958

DO - 10.1007/BF02578958

M3 - Article

SN - 1134-5764

VL - 12

SP - 277

EP - 281

JO - TOP: Transactions in Operations Research

JF - TOP: Transactions in Operations Research

IS - 2

ER -

Discussion: [On self-regular IPMs, Salahi, M et al.]

Abstract

Keywords

Access to Document

Fingerprint

Cite this