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

Tibor Illés

Research output: Contribution to journalArticle

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.
LanguageEnglish
Pages277-281
Number of pages5
JournalTOP: AN OFFICIAL JOURNAL OF THE SPANISH SOCIETY OF STATISTICS AND OPERATIONS RESEARCH
Volume12
Issue number2
DOIs
Publication statusPublished - 1 Dec 2004

Fingerprint

Linear Optimization
Optimization Problem
Polynomials
Iteration
Polynomial

Keywords

  • linear optimization
  • IPMs
  • polynomial
  • algorithm

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(~))), 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 = "12",
day = "1",
doi = "10.1007/BF02578958",
language = "English",
volume = "12",
pages = "277--281",
journal = "TOP: AN OFFICIAL JOURNAL OF THE SPANISH SOCIETY OF STATISTICS AND OPERATIONS RESEARCH",
issn = "1134-5764",
number = "2",

}

Discussion : [On self-regular IPMs, Salahi, M et al.]. / Illés, Tibor.

In: TOP: AN OFFICIAL JOURNAL OF THE SPANISH SOCIETY OF STATISTICS AND OPERATIONS RESEARCH, Vol. 12, No. 2, 01.12.2004, p. 277-281.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Discussion

T2 - TOP: AN OFFICIAL JOURNAL OF THE SPANISH SOCIETY OF STATISTICS AND OPERATIONS RESEARCH

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

VL - 12

SP - 277

EP - 281

JO - TOP: AN OFFICIAL JOURNAL OF THE SPANISH SOCIETY OF STATISTICS AND OPERATIONS RESEARCH

JF - TOP: AN OFFICIAL JOURNAL OF THE SPANISH SOCIETY OF STATISTICS AND OPERATIONS RESEARCH

SN - 1134-5764

IS - 2

ER -