Skip to main content
SpringerLink
Log in

Interior-point algorithms for global optimization

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We describe recent developments in interior-point algorithms for global optimization. We will focus on the algorithmic research for nonconvex quadratic programming, linear complementarity problem, and integer programming. We also outline directions in which future progress might be made.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Bayer and J.C. Lagarias, The nonlinear geometry of linear programming, I: Affine and projective scaling trajectories, Trans. Am. Math. Soc. 314 (1989) 499–581.

    Google Scholar 

  2. E.M.L. Beale, On quadratic programming, Naval Res. Logistics Quarterly 6 (1959) 227–243.

    Google Scholar 

  3. R.W. Cottle and G.B. Dantzig, Complementary pivot theory of mathematical programming, Linear Algebra Appl. 1 (1968) 103–125.

    Google Scholar 

  4. R.W. Cottle, J.S. Pang and V. Venkateswaran, Sufficient matrices and the linear complementarity problem, Linear Algebra Appl. 114/115 (1989) 231–249.

    Google Scholar 

  5. R.W. Cottle and A.F. Veinott, Jr., Polyhedral sets having a least element, Math. Programming 3 (1969) 238–249.

    Google Scholar 

  6. I.I. Dikin, Iterative solution of problems of linear and quadratic programming, Sov. Math. Doklady 8 (1967) 674–675.

    Google Scholar 

  7. R. Fletcher, A general quadratic programming algorithm, J. Inst. Math. Appl. 7 (1971) 76–91.

    Google Scholar 

  8. M.R. Garey and D.S. Johnson,Computers and Intractability, A Guide to the Theory of NP-Completeness (Freeman, New York, 1968).

    Google Scholar 

  9. D.M. Gay, Computing optimal locally constrained steps, SIAM J. Sci. Statis. Comput. 2 (1981) 186–197.

    Google Scholar 

  10. P.E. Gill and W. Murray, Newton type methods for unconstrained and linearly constrained optimization, Math. Programming 7 (1974) 311–350.

    Google Scholar 

  11. D. Goldfarb, Extensions of Newton's method and simplex methods for solving quadratic programs, in:Numerical Methods for Nonlinear Optimization, ed. F.A. Lootsma (Academic Press, London, 1972).

    Google Scholar 

  12. F.S. Hillier, Efficient heuristic procedures for integer linear programming with an interior, Oper. Res. 17 (1969) 600–637.

    Google Scholar 

  13. B. Kalantari, Canonical problems for quadratic programming and projective methods for their solution, manuscript, Department of Computer Science, Rutgers University, New Brunswick, NJ (1988).

    Google Scholar 

  14. B. Kalantari and J.B. Rosen, An algorithm for global minimization of linearly constrained concave quadratic functions, Math. Oper. Res. 12 (1987) 544–561.

    Google Scholar 

  15. A.P. Kamath, N. Karmarkar, K.G. Ramakrishnan and M.G.C. Resende, Computational experience with an interior point algorithm on the satisfiability problem, Technical Report, AT & T Bell Laboratories, Murray Hill, NJ (1989).

    Google Scholar 

  16. S. Kapoor and P. Vaidya, Fast algorithms for convex quadratic programming and multicommodity flows,Proc. 18th Annual ACM Symp. on the Theory of Computing (1989) pp. 147–159.

  17. N. Karmarkar, An interior-point approach to NP-complete problems, extended abstract, AT&T Bell Laboratories, Murray Hill, NJ (1988).

    Google Scholar 

  18. N. Karmarkar, A new polynomial-time algorithm for linear programming. Combinatorica 4 (1984) 373–395.

    Google Scholar 

  19. N. Karmarkar, M.G.C. Resende and K.G. Ramakrishnan, An interior point algorithm to solve computationally difficult set covering problems, Technical Report, AT&T Bell Laboratories. Murray Hill, NJ (1989).

    Google Scholar 

  20. N. Karmarkar, M.G.C. Resende and K.G. Ramakrishnan, An interior point approach to the maximum independent set problem in dense random graphs. Technical Report, AT&T Bell Laboratories, Murray Hill, NJ (1989).

    Google Scholar 

  21. L.G. Khachiyan, A polynomial algorithm for linear programming, Sov. Math. Doklady 20 (1979) 191–194.

    Google Scholar 

  22. M. Kojima, N. Megiddo and T. Noma, Homotopy continuation methods for complementarity problems, manuscript, IBM Almaden Research Center, San Jose, CA (1988).

    Google Scholar 

  23. M. Kojima, N. Mizuno and T. Noma, A new continuation method for complementarity problems with uniform P-functions, manuscript (1988), to appear in Math. Programming.

  24. M. Kojima, N. Megiddo and Y. Ye, An interior point potential reduction algorithm for the linear complementarity problem. Research Report RJ 6486, IBM Almaden Research Center. San Jose, CA (1988), to appear in Math. Programming.

    Google Scholar 

  25. M. Kojima, S. Mizuno and A. Yoshise, An\(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems, Research Report on Information Sciences B-217, Tokyo Institute of Technology, Tokyo, Japan (1988).

    Google Scholar 

  26. M. Kojima, S. Mizuno and A. Yoshise, A polynomial-time algorithm for a class of linear complementarity problems, Math. Programming 44 (1989) 1–26.

    Google Scholar 

  27. M.K. Kozlov, S.P. Tarasov and L.G. Khachiyan, Polynomial solvability of convex quadratic programming, Sov. Math. Doklady 20 (1979) 1108–1111.

    Google Scholar 

  28. C.E. Lemke, Bimatrix equilibrium points and mathematical programming, Management Sci. 11 (1965) 681–689.

    Google Scholar 

  29. O.L. Mangasarian, Linear complementarity problems solvable by a single linear program, Math. Programming 10 (1977) 263–270.

    Google Scholar 

  30. N. Megiddo, Pathways to the optimal set in linear programming, in:Progress in Mathematical Programming, ed. N. Megiddo (Springer, 1988) pp. 131–158.

  31. R.C. Monteiro and I. Adler, AnO(n 3 L) primal-dual interior point algorithm for convex quadratic programming, Math. Programming 44 (1989) 27–42.

    Google Scholar 

  32. J.J. Moré and D.C. Sorensen, Computing a trust region step, SIAM J. Sci. Statist. Comput. 4 (1983) 553–572.

    Google Scholar 

  33. J.J. Moré and V. Vavasis, On the solution of concave knapsack problems, Preprint MCS-P40-1288, Argonne National Laboratory, Argonne, IL (1988).

    Google Scholar 

  34. K.G. Murty and S.N. Kabadi, Some NP-complete problems in quadratic and nonlinear programming, Math. Programming 39 (1987) 117–129.

    Google Scholar 

  35. G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988).

    Google Scholar 

  36. Yu.E. Nesterov and A.S. Nemirovsky,Self-Concordant Functions and Polynomial-Time Methods in Convex Programming (USSR Academy of Sciences, Central Economic and Mathematic Institute, Moscow, 1989).

    Google Scholar 

  37. P.M. Pardalos and J.B. Rosen,Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Sciences, vol. 268 (Springer, 1987).

  38. P.M. Pardalos and G. Schnitger, Checking local optimality in constrained quadratic programming is NP-hard, Oper. Res. Lett. 7 (1988) 33–35.

    Google Scholar 

  39. P.M. Pardalos, Y. Ye and C.-G. Han, Algorithms for the solution of quadratic knapsack problems, Technical Report CS-89-10, Department of Computer Science, The Pennsylvania State University, University Park, PA (1989).

    Google Scholar 

  40. J. Renegar, A polynomial-time algorithm based on Newton's method for linear programming, Math. Programming 40 (1988) 59–93.

    Google Scholar 

  41. G. Sonnevend, An “analytic center” for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming,Proc. 12th IFIP Conf. on System Modeling and Optimization, Budapest, Hungary (1985).

  42. R.E. Stone, Geometric aspects of the linear complementarity problem, Technical Report SOL 81-6, Department of OR, Stanford University, Stanford, CA (1981).

    Google Scholar 

  43. M.J. Todd and Y. Ye, A centered projective algorithm for linear programming, Technical Report 763, School of ORIE, Cornell University, Ithaca, NY (1987), to appear in Math. Oper. Res.

    Google Scholar 

  44. P. Wolfe, The simplex algorithm for quadratic programming, Econometrica 27 (1959) 382–398.

    Google Scholar 

  45. Y. Ye, Interior point algorithms for quadratic programming, Working Paper 89-29, College of Business Administration, The University of Iowa, Iowa City, IA (1989).

    Google Scholar 

  46. Y. Ye, AnO(n 3 L) potential reduction algorithm for linear programming, manuscript (1988), to appear in Math. Programming.

  47. Y. Ye, On affine scaling algorithms for nonconvex quadratic programming, manuscript (1988), submitted to Math. Programming.

  48. Y. Ye, A further result on the potential reduction algorithm for the P-matrix linear complementarity problem, Working Paper (1988).

  49. Y. Ye and P. Pardalos, A class of linear complementarity problems solvable in polynomial time, manuscript (1989), submitted to Linear Algebra Appl.

Download references

Author information

Authors and Affiliations

  1. Department of Management Sciences, The University of Iowa, 52242, Iowa City, Iowa, USA

    Yinyu YE

Authors
  1. Yinyu YE
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

YE, Y. Interior-point algorithms for global optimization. Ann Oper Res 25, 59–73 (1990). https://doi.org/10.1007/BF02283687

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02283687

Keywords

Search

Navigation