dc.creatorMartinez, JM
dc.creatorSvaiter, BF
dc.date2003
dc.dateJUL
dc.date2014-11-15T05:54:51Z
dc.date2015-11-26T17:18:27Z
dc.date2014-11-15T05:54:51Z
dc.date2015-11-26T17:18:27Z
dc.date.accessioned2018-03-29T00:06:11Z
dc.date.available2018-03-29T00:06:11Z
dc.identifierJournal Of Optimization Theory And Applications. Springer/plenum Publishers, v. 118, n. 1, n. 117, n. 133, 2003.
dc.identifier0022-3239
dc.identifierWOS:000184123800007
dc.identifier10.1023/A:1024791525441
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/76654
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/76654
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/76654
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1282669
dc.descriptionA new optimality condition for minimization with general constraints is introduced. Unlike the KKT conditions, the new condition is satisfied by local minimizers of nonlinear programming problems, independently of constraint qualifications. The new condition is strictly stronger than and implies the Fritz - John optimality conditions. Sufficiency for convex programming is proved.
dc.description118
dc.description1
dc.description117
dc.description133
dc.languageen
dc.publisherSpringer/plenum Publishers
dc.publisherNew York
dc.publisherEUA
dc.relationJournal Of Optimization Theory And Applications
dc.relationJ. Optim. Theory Appl.
dc.rightsfechado
dc.rightshttp://www.springer.com/open+access/authors+rights?SGWID=0-176704-12-683201-0
dc.sourceWeb of Science
dc.subjectoptimality conditions
dc.subjectKarush-Kuhn-Tucker conditions
dc.subjectminimization algorithms
dc.subjectconstrained optimization
dc.subjectEquilibrium Constraints
dc.subjectRegularity Conditions
dc.subjectVector Optimization
dc.subjectGlobal Convergence
dc.subjectAlgorithm
dc.subjectEquality
dc.subjectSqp
dc.titleA practical optimality condition without constraint qualifications for nonlinear programming
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución