Advanced search
Publication Cover
Optimization Methods and Software Volume 27, 2012 - Issue 4-5: Special issue in honour of Professor Florian A. Potra's 60th birthday
Submit an article Journal homepage
136
Views
22
CrossRef citations to date
0
Altmetric
Original Articles

Interior-point algorithms for a generalization of linear programming and weighted centring

Kurt M. Anstreicher Department of Management Sciences, University of Iowa, Iowa City, IA, 52242, USACorrespondence[email protected]
Pages 605-612 | Received 23 Feb 2011, Accepted 22 Nov 2011, Published online: 30 Jan 2012

References

  • Anstreicher , K. M. 1997 . Volumetric path following algorithms for linear programming . Math. Program , 76 : 245 – 263 .
  • Atkinson , D. S. and Vaidya , P. M. 1992 . A scaling technique for finding the weighted analytic center of a polytope . Math. Program , 57 : 163 – 192 .
  • Denardo , E. V. , Hoffman , A. J. , Mackenzie , T. and Pulleyblank , W. R. 1991 . A nonlinear allocation problem . IBM J. Res. Dev , 38 : 301 – 306 .
  • Freund , R. M. 1988 . “ Projective transformations for interior point methods, Part II: Analysis of an algorithm for finding the weighted center of a polyhedral system ” . In Working paper OR 180-88 , Cambridge , MA : Operations Research Center, MIT .
  • Freund , R. M. 1993 . Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem . Math. Program , 58 : 385 – 414 .
  • Karmarkar , N. 1984 . A new polynomial-time algorithm for linear programming . Combinatorica , 4 : 373 – 395 .
  • Nesterov , Y. and Nemirovskii , A. 1994 . “ Interior-Point Polynomial Algorithms in Convex Programming ” . Philadelphia , PA : SIAM .
  • Terlaky , T. and Vial , J.-Ph. 1998 . Computing maximum likelihood estimators of convex density functions . SIAM J. Sci. Comput , 19 : 675 – 694 .
  • Vaidya , P. M. 1990 . An algorithm for linear programming which requires arithmetic operations . Math. Program , 47 : 175 – 201 .
  • Vaidya , P. M. 1996 . A new algorithm for minimizing convex functions over convex sets . Math. Program , 73 : 291 – 341 .
  • Vaidya , P. M. and Atkinson , D. S. 1993 . “ A technique for bounding the number of iterations in path following algorithms ” . In Complexity in Numerical Optimization , Edited by: Pardalos , P. M. 462 – 489 . Singapore : World Scientific .
  • Ye , Y. 2007 . Exchange market equilibria with Leontief's utility: Freedom of pricing leads to rationality . Theoret. Comput. Sci , 378 : 134 – 142 .
  • Ye , Y. 2008 . A path to the Arrow–Debreu competitive market equilibrium . Math. Program , 111 : 315 – 348 .

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.