Advanced search
Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 52, 2003 - Issue 4-5
Submit an article Journal homepage
35
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

A circular cone relaxation primal interior point algorithm for LP

Igor S. Litvinchev Computing Center Russian Academy of Sciences, Vavilov 40, Moscow 119991, Russia
Pages 529-540 | Received 28 Nov 2002, Accepted 23 Jul 2003, Published online: 13 May 2010

References

  • Barnes , E.R. 1986 . A variation on Karmarkar's algorithm for solving linear programming problems . Mathematical Programming , 36 : 174 – 182 .
  • Dikin , I.I. 1967 . Iterative solution of problems of linear and quadratic programming . Soviet Math. Dokl. , 8 : 674 – 675 .
  • Goldfarb , D. and Xiao , D. 1991 . A primal projective interior point method for linear programming . Mathematical Programming , 51 : 17 – 43 .
  • Gonzaga , C. 1992 . Path following methods for linear programming . SIAM Review , 34 : 167 – 227 .
  • Jan , G-M. and Fang , S-C. 1991 . A new variant of the primal affine scaling algorithm for linear programs . Optimization , 22 : 681 – 715 .
  • Karmarkar , N.K. 1984 . A new polynomial-time algorithm for linear programming . Combinatorica , 4 : 373 – 395 .
  • Litvinchev , I.S. 1994 . The use of lower bounds in minimization by the interior-point method . Computational Mathematics and Mathematical Physics , 34 : 843 – 847 .
  • Litvinchev I.S. 2002 Using circular cone relaxation in interior point algorithms Technical Report PISIS-2002-02. Graduate Program in System Engineering UANL Mexico
  • Padberg M. 1999 Linear Programming and Extensions 2nd Edn. Springer Berlin
  • Padberg , M. 1986 . A different convergence proof for the projective method . Operations Research Letters , 4 : 253 – 257 .
  • Roos , C. and Vial , J.-Ph. 1992 . A polynomial method of approximate centers for linear programming . Mathematical Programming , 54 : 295 – 305 .
  • Sturm , J.F. and Zhang , S. 1996 . An iteration bound primal-dual cone affine scaling algorithm for linear programming . Mathematical Programming , 72 : 177 – 194 .
  • Sturm , J.F. and Zhang , S. 1997 . On a wide region of centers and primal-dual interior point algorithms for linear programming . Mathematics of Operations Research , 22 : 408 – 431 .
  • Todd , M. 1992 . A low complexity interior-point algorithm for linear programming . SIAM J. Optimization , 2 : 198 – 209 .
  • Todd , M. 1996 . Potential-reduction methods in mathematical programming . Mathematical Programming , 76 : 3 – 45 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.