Morse Programs

Okitsugu Fujiwara

No 539, Cowles Foundation Discussion Papers from Cowles Foundation for Research in Economics, Yale University

Abstract: Spingarn and Rockafellar [13] showed in a program (Q_{v}^{u}) minimize {f(x) - u^{T}x subject to g(x) = m; that at any local minimum point x of (Q_{v}^{u}) the Jacobian matrix of g at x has full rank, strict complementary slackness holds and the second order sufficiency conditions hold, for almost every matrix{u v} in R^{n} times R^{m} (Lebesgue measure). The purpose of this paper is to explicate the geometry underlying their work and to exploit this geometry in the generic analysis of constrained optimization problems. Namely we show that their work can be reduced to the study of minimizing a Morse function on a manifold with boundary. We follow a classical tradition of first studying an equality constrained program and then reducing inequality constrained programs to a finite family of equality constrained programs, through the device of active (or binding) constraints.

Pages: 40 pages
Date: 1979-10
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://cowles.yale.edu/sites/default/files/files/pub/d05/d0539.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found

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:cwl:cwldpp:539

Ordering information: This working paper can be ordered from
Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA
The price is None.

Access Statistics for this paper

More papers in Cowles Foundation Discussion Papers from Cowles Foundation for Research in Economics, Yale University Yale University, Box 208281, New Haven, CT 06520-8281 USA. Contact information at EDIRC.
Bibliographic data for series maintained by Brittany Ladd ().