A Cone-continuity Constraint Qualification And Algorithmic Consequences

dc.creatorAndreani
dc.creatorRoberto; Martinez
dc.creatorJose Mario; Ramos
dc.creatorAlberto; Silva
dc.creatorPaulo J. S.
dc.date2016
dc.date2017-11-13T13:14:10Z
dc.date2017-11-13T13:14:10Z
dc.date.accessioned2018-03-29T05:52:01Z
dc.date.available2018-03-29T05:52:01Z
dc.identifierSiam Journal On Optimization. Siam Publications, v. 26, p. 96 - 110, 2016.
dc.identifier1052-6234
dc.identifier1095-7189
dc.identifierWOS:000373631500004
dc.identifier10.1137/15M1008488
dc.identifierhttp://epubs.siam.org/doi/abs/10.1137/15M1008488
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/327132
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1364157
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.descriptionEvery local minimizer of a smooth constrained optimization problem satisfies the sequential approximate Karush-Kuhn-Tucker (AKKT) condition. This optimality condition is used to define the stopping criteria of many practical nonlinear programming algorithms. It is natural to ask for conditions on the constraints under which AKKT implies KKT. These conditions will be called strict constraint qualifications (SCQs). In this paper we define a cone-continuity property (CCP) that will be shown to be the weakest possible SCQ. Its relation to other constraint qualifications will also be clarified. In particular, it will be proved that CCP is strictly weaker than the constant positive generator constraint qualification.
dc.description26
dc.description1
dc.description96
dc.description110
dc.descriptionPRONEX-Optimization [PRONEX-CNPq/FAPERJ E-26/111.449/2010-APQ1]
dc.descriptionCEPID-CeMEAI [FAPESP 2013/07375-0]
dc.descriptionCNPq [304618/2013-6, 482549/2013-0, 303750/2014-6, 303013/2013-3]
dc.descriptionFAPESP [2012/20339-0, 2013/05475-7]
dc.descriptionCAPES
dc.descriptionNational Project on Industrial Mathematics
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.languageEnglish
dc.publisherSIAM Publications
dc.publisherPhiladelphia
dc.relationSIAM Journal on Optimization
dc.rightsaberto
dc.sourceWOS
dc.subjectConstrained Optimization
dc.subjectOptimality Conditions
dc.subjectConstraint Qualifications
dc.subjectKkt Conditions
dc.subjectApproximate Kkt Conditions
dc.titleA Cone-continuity Constraint Qualification And Algorithmic Consequences
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución