6. Numerical Algorithms for Constrained Optimization
Lists
Only you see this
Abstract
This chapter deals with the solution of nonlinear programs with both equality and inequality constraints. It follows directly from the previous chapter and builds directly on these concepts and algorithms for equality constraints only. The key concept of this chapter is the extension for the treatment of inequality constraints. For this, we develop three approaches: sequential quadratic programming (SQP)-type methods, interior point methods, and nested projection methods. Both global and local convergence properties of these methods are presented and discussed. With these fundamental concepts we then describe and classify many of the nonlinear programming codes that are currently available. Features of these codes will be discussed along with their performance characteristics. Several examples are provided and a performance study is presented to illustrate the concepts developed in this chapter.
BibTeX
@inproceedings{biegler2010numerical,
author = {Lorenz T. Biegler},
title = {{6. Numerical Algorithms for Constrained Optimization}},
booktitle = {Society},
year = {2010},
doi = {10.1137/1.9780898719383.ch6},
}Loading related content...