SOME BASIC OPTIMIZATION THEOREMS

Jan A. Snyman () and Daniel N. Wilke ()
Additional contact information
Jan A. Snyman: University of Pretoria
Daniel N. Wilke: University of Pretoria

Chapter Chapter 5 in Practical Mathematical Optimization, 2018, pp 169-193 from Springer

Abstract: Abstract This chapter supplies the proofs for a number of theorems on which Chapters 1 to 4 have extensively relied on. In total nineteen proofs are presented of theorems that cover the characterization of unconstrained and constrained minima, saddle point conditions, conjugate gradient and Quasi-Newton methods.

Keywords: Saddle Point Condition; Chapter Supplies; Interior Local Minimum; Fletcher-Reeves Algorithm; Kuhn-Tucker Stationary Conditions (search for similar items in EconPapers)
Date: 2018
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-77586-9_5

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

DOI: 10.1007/978-3-319-77586-9_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 ().