NLP optimality conditions

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 3 in Introduction to Nonlinear and Global Optimization, 2010, pp 31-66 from Springer

Abstract: Abstract After an optimization problem has been formulated (or during the formulation), methods can be used to determine an optimal plan x *. In the application of NLP algorithms, x * is approximated iteratively. The user normally indicates how close an optimum should be approximated. We will discuss this in Chapter 4.

Keywords: Saddle Point; Stationary Point; Quadratic Function; Minimum Point; Maximum Point (search for similar items in EconPapers)
Date: 2010
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-0-387-88670-1_3

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

DOI: 10.1007/978-0-387-88670-1_3

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 ().