Iterative Solution Algorithms for Nonlinear Optimization

Ramteen Sioshansi () and Antonio J. Conejo ()
Additional contact information
Ramteen Sioshansi: The Ohio State University
Antonio J. Conejo: The Ohio State University

Chapter Chapter 5 in Optimization in Engineering, 2017, pp 287-336 from Springer

Abstract: Abstract Chapter 4 introduces optimality conditions to solve nonlinear programming problems (NLPPs). Optimality conditions have the benefit that they allow us to find all points that are candidate local minima, but can be quite cumbersome. For these reasons, in many practical cases NLPPs are solved using iterative algorithms that are implemented on a computer. In this chapter we begin by first introducing a generic iterative algorithm for solving an unconstrained NLPP. We also introduce two broad approaches to solving constrained NLPPs.

Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-56769-3_5

Ordering information: This item can be ordered from
http://www.springer.com/9783319567693

DOI: 10.1007/978-3-319-56769-3_5

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().