Skip to main content
SpringerLink
Log in

Numerical Experiments with an Interior-Exterior Point Method for Nonlinear Programming

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

The paper presents an algorithm for solving nonlinear programming problems. The algorithm is based on the combination of interior and exterior point methods. The latter is also known as the primal-dual nonlinear rescaling method. The paper shows that in certain cases when the interior point method (IPM) fails to achieve the solution with the high level of accuracy, the use of the exterior point method (EPM) can remedy this situation. The result is demonstrated by solving problems from COPS and CUTE problem sets using nonlinear programming solver LOQO that is modified to include the exterior point method subroutine.

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. H. Benson, D. Shanno, and R. Vanderbei, “Interior point methods for nonconvex nonlinear programming: filter methods and merit functions,” Technical Report ORFE-00-6, Dept. of ORFE, Princeton University, to appear in COAP.

  2. A.S. Bondarenko, D.M. Bortz, and J.J. More, “COPS: Constrained optimization problems,” Mathematics and Computer Science Division, Argonne National Laboratory, http://www-unix.mcs.anl.gov/more/cops

  3. I. Bongartz, A. Conn, N. Gould, and P. Toint, “CUTE: Constrained and unconstrained testing environment,” ACM Transactions on Mathematical Software, vol. 21, no. 1, pp. 123–160, 1993.

    Google Scholar 

  4. A. Fiacco and G. McCormick, “Nonlinear programming. sequential unconstrained minimization techniques,” SIAM Classic in Applied Mathematics, SIAM Philadelphia, PA, 1990.

    Google Scholar 

  5. R. Fletcher and S. Leyfer, “Nonlinear programming without a penalty function,” Mathematical Programming, vol. 91, no. 2, pp. 239–269, 2002.

    Google Scholar 

  6. P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin, and M.H. Wright, “On projected Newton barrier method for linear programming and equivalence to Karmarkar's projective method,” Mathematical Programming, vol. 36, pp. 183–209, 1986.

    Google Scholar 

  7. I. Griva and R. Polyak, “Primal-dual nonlinear rescaling method with dynamic scaling parameter update,” Mathematical Programming (to appear).

  8. B.W. Kort and D.P. Bertsekas, “Multiplier methods for convex programming,” in Proceedings IEEE Conference on Decision and Control, San Diego, California, pp. 428–432, 1973.

  9. I. Lustig, R. Marsten, and D. Shanno, “Interior point methods for linear programming; computational state of the art,” ORSA Journal on Computing, vol. 6, pp. 1–14, 1994.

    Google Scholar 

  10. N. Megiddo, “Pathways to the optimal set in linear programming,” in Interior Point and Related Methods, N. Megiddo (Ed.), Ch. 8, Springer-Verlag: New York, 1989, pp. 131–158.

    Google Scholar 

  11. Ju.E. Nesterov and A.S. Nemirovsky, “Self-concordant functions and Polynomial-Time methods in Convex programming,” CEMI Academi of Sciences, Moscow 1989.

    Google Scholar 

  12. R. Polyak, “Modified barrier functions,” Mathematical Programming, vol. 54, pp. 177–222, 1992.

    Google Scholar 

  13. R. Polyak and M. Teboulle, “Nonlinear rescaling and Proximal-like methods in convex optimization,” Mathematical Programming, vol. 76, pp. 265–284, 1997.

    Google Scholar 

  14. R. Polyak, I. Griva, and J. Sobieski, “The Newton log-Sigmoid method in Constrained Optimization,” A Collection of Technical Papers, 7th AIAA/USAF/NASA/ISSMO Symposium on Multidisciplinary Analysis and Optimization vol. 3, 1998, pp. 2193–2201.

    Google Scholar 

  15. R. Polyak, “Nonlinear rescaling vs. smoothing technique in convex optimization,” Mathematical Programming, Ser. A, vol. 92, pp. 197–235, 2002.

    Google Scholar 

  16. R. Polyak and I. Griva, “Primal-dual nonlinear rescaling method for Convex Optimization,” SEOR Technical report SEOR-02-05, http://www.princeton.edu/ igriva/papers.html to appear in JOTA.

  17. J. Renegar and M. Shub, “Unified complexity analysis for Newton LP methods,” Technical Report No. 807, School of Operations Research and Industrial Engineering, College of Engineering, Cornell University, Ithaca, NY, 1988.

    Google Scholar 

  18. R. Vanderbei, “Symmetric quasidefinite matrices,” SIAM Journal on Optimization, vol. 5, no. 1, pp. 100–113, 1995.

    Google Scholar 

  19. R.J. Vanderbei and D.F. Shanno, “An interior-point algorithm for nonconvex nonlinear programming,” COAP, vol. 13, pp. 231–252, 1999.

    Google Scholar 

  20. R.J. Vanderbei, “LOQO: An interior point code for quadratic programming,” Optimization Methods and Software, vol. 12, pp. 451–484, 1999.

    Google Scholar 

  21. R.J. Vanderbei, “LOQO user's manual—version 3.10,” Optimization Methods and Software, vol. 12, pp. 485–514, 1999.

    Google Scholar 

  22. S. Wright, Primal-dual interior points methods, SIAM, 1997.

Download references

Author information

Authors and Affiliations

  1. Department of ORFE, Princeton University, Princeton, NJ, 08544, USA

    Igor Griva

Authors
  1. Igor Griva
    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

Griva, I. Numerical Experiments with an Interior-Exterior Point Method for Nonlinear Programming. Computational Optimization and Applications 29, 173–195 (2004). https://doi.org/10.1023/B:COAP.0000042029.73199.83

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:COAP.0000042029.73199.83

Search

Navigation