Knitro: An Integrated Package for Nonlinear Optimization

  • Richard H. Byrd
  • Jorge Nocedal
  • Richard A. Waltz
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 83)


This paper describes Knitro 5.0, a C-package for nonlinear optimization that combines complementary approaches to nonlinear optimization to achieve robust performance over a wide range of application requirements. The package is designed for solving large-scale, smooth nonlinear programming problems, and it is also effective for the following special cases: unconstrained optimization, nonlinear systems of equations, least squares, and linear and quadratic programming. Various algorithmic options are available, including two interior methods and an active-set method. The package provides crossover techniques between algorithmic options as well as automatic selection of options and settings.

Key words

nonlinear optimization optimization software interior-point SLQP 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    E.D. Andersen and K.D. Andersen. The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm. In H. Frenk, K. Roos, T. Terlaky, and S. Zhang, editors, High Performance Optimization, pages 197–232, Dordrecht, The Netherlands, 2000. Kluwer Academic Publishers.Google Scholar
  2. 2.
    J. Betts, S. K. Eldersveld, P. D. Prank, and J. G. Lewis. An interior-point nonlinear programming algorithm for large scale optimization. Technical report MCT TECH-003, Mathematics and Computing Technology, The Boeing Company, P.O. Box 3707, Seattle WA 98124-2207, 2000.Google Scholar
  3. 3.
    R. H. Byrd, J.-Ch. Gilbert, and J. Nocedal. A trust region method based on interior point techniques for nonlinear programming. Mathematical Programming, 89(1):149–185, 2000.MathSciNetCrossRefGoogle Scholar
  4. 4.
    R. H. Byrd, N. I. M. Gould, J. Nocedal, and R. A. Waltz. On the convergence of successive linear-quadratic programming algorithms. Technical Report OTC 2002/5, Optimization Technology Center, Northwestern University, Evanston, IL, USA, 2002.Google Scholar
  5. 5.
    R. H. Byrd, N. I. M. Gould, J. Nocedal, and R. A. Waltz. An algorithm for nonlinear optimization using linear programming and equality constrained subproblems. Mathematical Programming, Series B, 100(1):27–48, 2004.MathSciNetGoogle Scholar
  6. 6.
    R. H. Byrd, M. E. Hribar, and J. Nocedal. An interior point algorithm for large scale nonlinear programming. SIAM Journal on Optimization, 9(4):877–900, 1999.MathSciNetCrossRefGoogle Scholar
  7. 7.
    R. H. Byrd, M. Marazzi, and J. Nocedal. On the convergence of Newton iterations to non-stationary points. Mathematical Programming, Series A, 99:127–148, 2004.MathSciNetCrossRefGoogle Scholar
  8. 8.
    R. H. Byrd, J. Nocedal, and R. A. Waltz. Feasible interior methods using slacks for nonlinear optimization. Computational Optimization and Applications, 26(1):35–61, 2003.MathSciNetCrossRefGoogle Scholar
  9. 9.
    C. M. Chin and R. Fletcher. On the global convergence of an SLP-filter algorithm that takes EQP steps. Mathematical Programming, Series A, 96(1): 161–177, 2003.MathSciNetCrossRefGoogle Scholar
  10. 10.
    T. F. Coleman. Linearly constrained optimization and projected preconditioned conjugate gradients. In J. Lewis, editor, Proceedings of the Fifth SIAM Conference on Applied Linear Algebra, pages 118–122, Philadelphia, USA, 1994. SIAM.Google Scholar
  11. 11.
    A. R. Conn, N. I. M. Gould, and Ph. Toint. Trust-region methods. MPS-SIAM Series on Optimization. SIAM publications, Philadelphia, Pennsylvania, USA, 2000.Google Scholar
  12. 12.
    A. R. Conn, N. I. M. Gould, and Ph. L. Toint. LANCELOT: a Fortran package for Large-scale Nonlinear Optimization (Release A). Springer Series in Computational Mathematics. Springer Verlag, Heidelberg, Berlin, New York, 1992.Google Scholar
  13. 13.
    E. D. Dolan, J. J. Moré, and T. S. Munson. Optimality measures for performance profiles. Technical report, Argonne National Laboratory, Argonne, IL, USA, 2004.Google Scholar
  14. 14.
    A. Drud. CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems. Mathematical Programming, 31:153–191, 1985.zbMATHMathSciNetGoogle Scholar
  15. 15.
    R. Fletcher and S. Leyffer. User manual for filtersqp. Technical Report NA/181, Dundee, Scotland, 1998.Google Scholar
  16. 16.
    R. Fletcher and E. Sainz de la Maza. Nonlinear programming and nonsmooth optimization by successive linear programming. Mathematical Programming, 43(3):235–256, 1989.MathSciNetCrossRefGoogle Scholar
  17. 17.
    E. Michael Gertz, J. Nocedal, and A. Sartenaer. A starting-point strategy for nonlinear interior methods. Applied Math Letters, 5, 2004.Google Scholar
  18. 18.
    P. E. Gill, W. Murray, and M. A. Saunders. SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM Journal on Optimization, 12:979–1006, 2002.MathSciNetCrossRefGoogle Scholar
  19. 19.
    G. H. Golub and C. F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, second edition, 1989.Google Scholar
  20. 20.
    N. I. M. Gould, M. E. Hribar, and J. Nocedal. On the solution of equality constrained quadratic problems arising in optimization. SIAM Journal on Scientific Computing, 23(4):1375–1394, 2001.MathSciNetCrossRefGoogle Scholar
  21. 21.
    Christelle Guéret, Christian Prins, and Marc Sevaux. Applications of optimization with Xpress-MP. Dash Optimization, 2002.Google Scholar
  22. 22.
    C. Gurwitz and M. L. Overton. Sequential quadratic programming methods based on approximating a projected hessian matrix. SIAM Journal on Scientific and Statistical Computing, 10(4):631–653, 1989.MathSciNetCrossRefGoogle Scholar
  23. 23.
    ILOG CPLEX 8.0. User’s Manual. ILOG SA, Gentilly, France, 2002.Google Scholar
  24. 24.
    C. Keller, N. I. M. Gould, and A. J. Wathen. Constraint preconditioning for indefinite linear systems. SIAM Journal on Matrix Analysis and Applications, 21(4):1300–1317, 2000.MathSciNetCrossRefGoogle Scholar
  25. 25.
    M. Kocvara. Results of NLP problems: performance profiles, 2003. Scholar
  26. 26.
    L. Lukšan and J. Vlček. Indefinitely preconditioned inexact Newton method for large sparse equality constrained nonlinear programming problems. Numerical Linear Algebra with Applications, 5(3):219–247, 1998.MathSciNetCrossRefGoogle Scholar
  27. 27.
    N. Megiddo. Pathways to the optimal set in linear programming. In N. Megiddo, editor, Progress in mathematical programming: Interior-point and related methods, chapter 8, pages 131–158. Springer-Verlag, New York, 1989.Google Scholar
  28. 28.
    J. L. Morales, J. Nocedal, R. A. Waltz, G. Liu, and J. P. Goux. Assessing the potential of interior methods for nonlinear optimization. In L. T. Biegler, O. Ghattas, M. Heinkenschloss, and B. van Bloemen Waanders, editors, Large-Scale PDE-Constrained Optimization, volume 30, pages 167–183, Heidelberg, Berlin, New York, 2003. Springer Verlag. Lecture Notes in Computational Science and Engineering.Google Scholar
  29. 29.
    B. A. Murtagh and M. A. Saunders. MINOS 5.4 user’s guide. Technical report, SOL 83-20R, Systems Optimization Laboratory, Stanford University, 1983. Revised 1995.Google Scholar
  30. 30.
    J. Nocedal, A. Wächter, and R. A. Waltz. Adaptive barrier strategies for nonlinear interior methods. Technical Report RC 23563, IBM Watson Research Center, Yorktown Heights, NY, USA, 2005.Google Scholar
  31. 31.
    J. Nocedal and S. J. Wright. Numerical Optimization. Springer Series in Operations Research. Springer, 1999.Google Scholar
  32. 32.
    B. T. Polyak. The conjugate gradient method in extremal problems. U.S.S.R. Computational Mathematics and Mathematical Physics, 9:94–112, 1969.CrossRefGoogle Scholar
  33. 33.
    R. J. Vanderbei and D. F. Shanno. An interior point algorithm for nonconvex nonlinear programming. Computational Optimization and Applications, 13:231–252, 1999.MathSciNetCrossRefGoogle Scholar
  34. 34.
    A. Wächter. An interior point algorithm for large-scale nonlinear optimization with applications in process engineering. PhD thesis, Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, 2002.Google Scholar
  35. 35.
    A. Wächter and L. T. Biegler. Failure of global convergence for a class of interior point methods for nonlinear programming. Mathematical Programming, 88(3):565–574, 2000.MathSciNetCrossRefGoogle Scholar
  36. 36.
    A. Wächter and L. T. Biegler. On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Technical Report RC 23149, IBM T. J. Watson Research Center, Yorktown Heights, NY, USA, March 2004.Google Scholar
  37. 37.
    R. A. Waltz. Knitro 4.0 User’s Manual. Technical report, Ziena Optimization, Inc., Evanston, IL, USA, October 2004.Google Scholar
  38. 38.
    R. A. Waltz, J. L. Morales, J. Nocedal, and D. Orban. An interior algorithm for nonlinear optimization that combines line search and trust region steps. Technical Report 2003-6, Optimization Technology Center, Northwestern University, Evanston, IL, USA, June 2003. To appear in Mathematical Programming A.Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2006

Authors and Affiliations

  • Richard H. Byrd
    • 1
  • Jorge Nocedal
    • 2
  • Richard A. Waltz
    • 2
  1. 1.Department of Computer ScienceUniversity of ColoradoBoulderUSA
  2. 2.Department of Electrical and Computer EngineeringNorthwestern UniversityEvanstonUSA

Personalised recommendations