Free Access
RAIRO-Oper. Res.
Volume 28, Number 2, 1994
Page(s) 135 - 163
Published online 06 February 2017
  • 1. C. W. CARROLL, The Created Response Surface Technique for Optimizing Nonlinear Restrainecl Systems, Operations Research, 1961, 9, pp. 169-184. [Zbl: 0111.17004] [Google Scholar]
  • 2. D. DEN HERTOG, C. ROOS and T. TERLAKY, A potential Reduction Variant of Renegar's Short-Step Path-Following Method for Linear Programming, Linear Algebra and Its Applications, 1991, 68, pp. 43-68. [Zbl: 0734.65050] [Google Scholar]
  • 3. D. DEN HERTOG, C. ROOS and J.-Ph. VIAL, A √n Complexity Reduction for Long Step Path-following Methods, SIAM Journal on Optimization, 1992, 2, pp. 71-87. [Zbl: 0763.90064] [Google Scholar]
  • 4. J. R. ERIKSSON, An Iterative Primal-Dual Algorithm for Linear Programming, Report LiTH-MAT-R-1985-10, 1985, Department of Mathematics, Linköping University, Linköping, Sweden. [Google Scholar]
  • 5. A. V. FIACCO and G. P. MCCORMICK, Nonlinear Programming, Sequential Unconstrained Minimization Techniques, Wiley and Sons, New York, 1968. [Zbl: 0563.90068] [Google Scholar]
  • 6. R. FLETCHER and A. P. MCCANN, Acceleration Techniques for Nonlinear Programming, In Optimization, R. Fletcher ed., Academie Press, London, 1969, pp. 203-214. [Zbl: 0194.47704] [Google Scholar]
  • 7. R. FRISCH, The Logarithmic Potential Method for Solving Linear Programming Problems, Memorandum, University Institute of Economies, Oslo, 1955. [Google Scholar]
  • 8. C. C. GONZAGA, An Algorithm for Solving Linear Programming Problems in O(n3 L) Operations, In Progress in Mathematical Programming, Interior Point and Related Methods, pp. 1-28, N. Megiddo ed., Springer Verlag, New York, 1989. [MR: 982713] [Zbl: 0691.90053] [Google Scholar]
  • 9. C. C. GONZAGA, Large-Steps Path-Following Methods for Linear Programming: Barrier Function Method, SIAM Journal on Optimization, 1991, 1, pp. 268-279. [MR: 1098430] [Zbl: 0754.90035] [Google Scholar]
  • 10. P. HUARD, Resolution of Mathematical Programming with Nonlinear Constraints by the Methods of Centres, In Nonlinear Programming, J. Abadie éd., North-Holland Publishing Company, Amsterdam, Holland, 1989, pp. 207-219. [MR: 216865] [Zbl: 0157.49701] [Google Scholar]
  • 11. N. KARMARKAR, A New Polynomial-Time Algorithm for Linear Programming, Comhinatorica, 4, 1984, pp. 373-395. [MR: 779900] [Zbl: 0557.90065] [Google Scholar]
  • 12. J. KOWALK, Nonlinear Programming Procedures and Design Optimization, Acta Polyntech. Scand., 1966, 13, Trondheim. [MR: 207398] [Google Scholar]
  • 13. G. P. MCCORMICK, W. C. MYLANDER and A. V. FIACCO, Computer Program Implementing the Sequential Unconstrained Minimization Technique for Nonlinear Programming, Technical Paper RAC-TP-151, Research Analysis Corporation, McLean, 1965. [Google Scholar]
  • 14. N. MEGIDDO, Pathways to the Optimal Set in Linear Programming, In Progress in Mathematical Programming, Interior Point and Related Methods, pp. 131-158, N. Megiddo ed., Springer Verlag, New York, 1989. [MR: 982720] [Zbl: 0687.90056] [Google Scholar]
  • 15. R. D. C. MONTEIRO and I. ADLER, Interior Path Following Prima-Dual Algorithms, Part I: Linear Programming, Mathematical Programming, 1989, 44, pp. 27-41. [MR: 999721] [Zbl: 0676.90038] [Google Scholar]
  • 16. R. A. POLYAK, Modified Banier Functions (theory and methods), Mathematical Programming, 1992, 54, pp. 174-222. [Zbl: 0756.90085] [Google Scholar]
  • 17. J. RENEGAR, A Polynomial-Time Algorithm, Based on Newton's Method, for Linear Programming, Mathematical Programming, 1988, 40, pp.59-93. [MR: 923697] [Zbl: 0654.90050] [Google Scholar]
  • 18. C. Roos and J.-Ph. VIAL, A Polynomial Method of Approximate Centers for Linear Programming, Mathematical Programming, 1992, 54, pp.295-305. [MR: 1159483] [Zbl: 0771.90067] [Google Scholar]
  • 19. C. Roos and J.-Ph. VIAL, Long Steps with the Logarithmic Penalty Banier Function in Linear Programming, In Economic Decision-Making: Games, Economics and Optimization, dedicated to Jacques H. Drèze, edited by J. Gabszevwicz, J.-F. Richard and L. Wolsey, Elsevier Sciences Publisher B. V., 1989, pp. 433-441. [Zbl: 0709.90076] [Google Scholar]
  • 20. A. TAMURA, H. TAKEHARA, K. FUKUDA, S. FUJISHIGE and S. KOJIMA, A Dual Primal Simplex Methods for Linear Programming, Journal of the Operations Research Society of Japan, 1988, 31, pp.413-429. [Zbl: 0658.90062] [Google Scholar]
  • 21. D. J. WHITE, Linear Programming and Huard's Method of Centres, Working, Paper, Universities of Manchester and Virginia, United Kingdom, 1989. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.