skip to content
Local Duality of Nonlinear Programs. Preview this item
ClosePreview this item
Checking...

Local Duality of Nonlinear Programs.

Author: O Fujiwara; S -P Han; O L Mangasarian; WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER.
Publisher: Ft. Belvoir Defense Technical Information Center FEB 1982.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
It is shown that the second order sufficient (necessary) optimality condition for the dual of a nonlinear program is equivalent to the inverse of the Hessian of the Lagrangian being positive definite (semidefinite) on the normal cone to the local primal constraint surface. This compares with the Hessian itself being positive definite (semidefinite) on the tangent cone on the local primal constraint surface for the  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: O Fujiwara; S -P Han; O L Mangasarian; WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER.
OCLC Number: 227533231
Notes: Sponsored in part by Grant NSF-ENG79-03881.
Description: 23 p.

Abstract:

It is shown that the second order sufficient (necessary) optimality condition for the dual of a nonlinear program is equivalent to the inverse of the Hessian of the Lagrangian being positive definite (semidefinite) on the normal cone to the local primal constraint surface. This compares with the Hessian itself being positive definite (semidefinite) on the tangent cone on the local primal constraint surface for the corresponding second order condition for the primal problem. We also show that primal second order sufficiency (necessity) and dual second order necessity (sufficiency) is essentially equivalent to the Hessian of the Lagrangian being positive definite. This follows from the following interesting linear algebra result: a necessary and sufficient condition for a nonsingular nxn matrix to be positive definite is that for each or some subspace of r(n), the matrix must be positive definite on the subspace and its inverse be positive semidefinite on the orthogonal complement of the subspace. (Author).

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227533231>
library:oclcnum"227533231"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227533231>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
schema:about
schema:about
schema:about
rdf:typeschema:Intangible
schema:name"Theoretical Mathematics."
schema:about
schema:about
rdf:typeschema:Intangible
schema:name"Nonlinear programming."
schema:about
schema:about
rdf:typeschema:Intangible
schema:name"Nonlinear algebraic equations."
schema:contributor
schema:contributor
rdf:typeschema:Organization
schema:name"WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER."
schema:contributor
schema:contributor
schema:datePublished"FEB 1982"
schema:datePublished"1982"
schema:description"It is shown that the second order sufficient (necessary) optimality condition for the dual of a nonlinear program is equivalent to the inverse of the Hessian of the Lagrangian being positive definite (semidefinite) on the normal cone to the local primal constraint surface. This compares with the Hessian itself being positive definite (semidefinite) on the tangent cone on the local primal constraint surface for the corresponding second order condition for the primal problem. We also show that primal second order sufficiency (necessity) and dual second order necessity (sufficiency) is essentially equivalent to the Hessian of the Lagrangian being positive definite. This follows from the following interesting linear algebra result: a necessary and sufficient condition for a nonsingular nxn matrix to be positive definite is that for each or some subspace of r(n), the matrix must be positive definite on the subspace and its inverse be positive semidefinite on the orthogonal complement of the subspace. (Author)."
schema:exampleOfWork<http://worldcat.org/entity/work/id/766239200>
schema:inLanguage"en"
schema:name"Local Duality of Nonlinear Programs."
schema:numberOfPages"23"
schema:publisher
rdf:typeschema:Organization
schema:name"Defense Technical Information Center"

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.