An interior point method for nonlinear programming with infeasibility detection capabilities

Jorge Nocedal*, Figen Öztoprak, Richard A. Waltz

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Scopus citations


This paper describes an interior point method for nonlinear programming endowed with infeasibility detection capabilities. The method is composed of two phases, a main phase whose goal is to seek optimality, and a feasibility phase that aims exclusively at improving feasibility. An important feature of the algorithm is the use of a step-decomposition interior-point approach in which the step is the sum of a normal component and a tangential component. The normal component of the step provides detailed information that allows the algorithm to determine whether it should transition from the main phase to the feasibility phase. We give particular attention to the reliability of the switching mechanism between the two phases. The algorithm proposed in this paper has been implemented in the knitro package as extensions of the knitro/cg method. Numerical results illustrate the performance of our method on both feasible and infeasible problems.

Original languageEnglish (US)
Pages (from-to)837-854
Number of pages18
JournalOptimization Methods and Software
Issue number4
StatePublished - Jul 4 2014


  • infeasibility detection
  • interior point method
  • nonlinear optimization

ASJC Scopus subject areas

  • Software
  • Control and Optimization
  • Applied Mathematics

Fingerprint Dive into the research topics of 'An interior point method for nonlinear programming with infeasibility detection capabilities'. Together they form a unique fingerprint.

Cite this