Nonlinear Programming algorithms

Eligius M. T. Hendrix () and Boglárka G.-Tóth ()
Additional contact information
Eligius M. T. Hendrix: Málaga University
Boglárka G.-Tóth: Budapest University of Technology and Economics

Chapter 5 in Introduction to Nonlinear and Global Optimization, 2010, pp 91-136 from Springer

Abstract: Abstract This chapter describes algorithms that have been specifically designed for finding optima of Nonlinear Programming (NLP) problems.

Keywords: Line Search; Steep Descent; Minimum Point; Descent Direction; Golden Section (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (30)

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-0-387-88670-1_5

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

DOI: 10.1007/978-0-387-88670-1_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 ().