Skip to main content
SpringerLink
Log in
Book cover

Continuous Nonlinear Optimization for Engineering Applications in GAMS Technology pp 397–413Cite as

Interior Point Sequential Linear-Quadratic Programming: KNITRO/INTERIOR

  • Chapter
  • First Online:

  • 1615 Accesses

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 121))

Abstract

In Chapter 14 the KNITRO/ACTIVE algorithm based on the active-set sequential programming method has been presented. In this chapter the KNITRO/INTERIOR algorithm is being described, together with its numerical performances for solving large-scale general continuously nonlinear optimization problems. KNITRO/INTERIOR provides two procedures for computing the steps within the interior point approach. In the version INTERIOR-CG, each step is computed using a projected conjugate gradient iteration. It factors a projection matrix and uses the conjugate gradient method to approximately minimize a quadratic model of the barrier problem. In the version INTERIOR-DIRECT, the algorithm attempts to compute a new iterate by solving the primal-dual KKT system using direct linear algebra. In case this step cannot be guaranteed to be of good quality or if a negative curvature is detected, then the new iterate is computed by the INTERIOR-CG algorithm. The description of the KNITRO/INTERIOR-CG algorithm is given by Byrd et al. (1999), and its global convergence theory is presented by Byrd et al. (2000). The method implemented in the KNITRO/INTERIOR-DIRECT algorithm is described by Waltz et al. (2003).

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

References

  • Andrei, N. (2015). Critica Raţiunii Algoritmilor de Optimizare cu Restricţii. [Criticism of the Constrained Optimization Algorithms Reasoning]. Bucureşti, Balkans: Editura Academiei Române

    Google Scholar 

  • Byrd, R. H., Hribar, M. E., & Nocedal, J. (1999). An interior point method for large scale nonlinear programming. SIAM Journal on Optimization, 9, 877–900.

    Article  MathSciNet  MATH  Google Scholar 

  • Byrd, R. H., Gilbert, J.-C., & Nocedal, J. (2000). A trust region method based on interior point techniques for nonlinear programming. Mathematical Programming, 89, 149–185.

    Article  MathSciNet  MATH  Google Scholar 

  • Byrd, R. H., Marazzi, M., & Nocedal, J. (2004b). On the convergence of Newton iterations to non-stationary points. Mathematical Programming, Series A, 99, 127–148.

    Article  MathSciNet  MATH  Google Scholar 

  • Byrd, R. H., Nocedal, J., & Waltz, R. A. (2006). KNITRO: An integrated package for nonlinear optimization. In G. Di Pillo & M. Roma (Eds.), Large-scale nonlinear optimization (pp. 35–59). Boston, MA, USA: Springer Science+Business Media.

    Chapter  Google Scholar 

  • GAMS – The solver manuals. (2005). GAMS Development Corporation.

    Google Scholar 

  • Megiddo, N. (1989). Chapter 8. Pathways to the optimal set in linear programming. In N. Megiddo (Ed.), Progress in mathematical programming: Interior-point and related methods (pp. 131–158). New York, NY, USA: Springer.

    Chapter  Google Scholar 

  • Nocedal, J., & Wright, S. J. (2006). Numerical optimization, Springer series in operations research (2nd ed.). New York, NY, USA: Springer Science+Business Media.

    MATH  Google Scholar 

  • Nocedal, J., Wächter, A., & Waltz, R. A. (2005). Adaptive barrier strategies for nonlinear interior methods. (Technical Report RC 23563, IBM Watson Research Center, Yorktown Heights, NY, USA).

    Google Scholar 

  • Vanderbei, R. J., & Shanno, D. F. (1999). An interior point algorithm for nonconvex nonlinear programming. Computational Optimization and Applications, 13, 231–252.

    Article  MathSciNet  MATH  Google Scholar 

  • Wächter, A., & Biegler, L. T. (2000). Failure of global convergence for a class of interior point methods for nonlinear programming. Mathematical Programming, 88, 565–574.

    Article  MathSciNet  MATH  Google Scholar 

  • Wächter, A., & Biegler, L. T. (2005a). Line search filter methods for nonlinear programming: Motivation and global convergence. SIAM Journal on Optimization, 16, 1–31.

    Article  MathSciNet  MATH  Google Scholar 

  • Wächter, A., & Biegler, L. T. (2005b). Line search filter methods for nonlinear programming: Local convergence. SIAM Journal on Optimization, 16, 32–48.

    Article  MathSciNet  MATH  Google Scholar 

  • Wächter, A., & Biegler, L. T. (2006). On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Mathematical Programming, 106, 25–57.

    Article  MathSciNet  MATH  Google Scholar 

  • Waltz, R. A. (2004). KNITRO 4.0 user’s manual. (Evanston, IL: Technical Report, Ziena Optimization Inc., October 2004).

    Google Scholar 

  • Waltz, R. A., Morales, J. L., Nocedal, J., & Orban, D. (2003). An interior algorithm for nonlinear optimization that combines line search and trust region step. Vol 107. (Technical Report 2003–6, Optimization Technology Center, Northwestern University, Evanston, IL, USA, June 2003. [Mathematical Programming, 2006:391–408.]).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Informatics, Center for Advanced Modeling & Optimization, Bucharest, Romania

    Neculai Andrei

  2. Academy of Romanian Scientists, Bucharest, Romania

    Neculai Andrei

Authors
  1. Neculai Andrei
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Andrei, N. (2017). Interior Point Sequential Linear-Quadratic Programming: KNITRO/INTERIOR. In: Continuous Nonlinear Optimization for Engineering Applications in GAMS Technology. Springer Optimization and Its Applications, vol 121. Springer, Cham. https://doi.org/10.1007/978-3-319-58356-3_19

Download citation

Publish with us

Policies and ethics

Search

Navigation