5. Newton Methods for Equality Constrained Optimization

Lorenz T. BieglerSociety 2010 · DOI · OpenAlex

Abstract

This chapter extends the Newton-based algorithms in Chapter 3 to deal with equality constrained optimization. It generalizes the concepts of Newton iterations and associated globalization strategies to the optimality conditions for this constrained optimization problem. As with unconstrained optimization we focus on two important aspects: solving for the Newton step and ensuring convergence from poor starting points. For the first aspect, we focus on properties of the KKT system and introduce both full- and reduced-space approaches to deal with equality constraint satisfaction and constrained minimization of the objective function. For the second aspect, the important properties of penalty-based merit functions and filter methods will be explored, both for line search and trust region methods. Several examples are provided to illustrate the concepts developed in this chapter and to set the stage for the nonlinear programming codes discussed in Chapter 6.
BibTeX
@inproceedings{biegler2010newton,
  author = {Lorenz T. Biegler},
  title = {{5. Newton Methods for Equality Constrained Optimization}},
  booktitle = {Society},
  year = {2010},
  doi = {10.1137/1.9780898719383.ch5},
}

Loading related content...

Figure