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.
Original languageEnglish
Pages (from-to)277-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

Keywords

  • linear optimization
  • IPMs
  • polynomial
  • algorithm

Cite this