Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/348190
Full metadata record
DC FieldValueLanguage
dc.contributor.CRUESPUNIVERSIDADE ESTADUAL DE CAMPINASpt_BR
dc.contributor.authorunicampAndreani, Roberto-
dc.typeArtigopt_BR
dc.titleA relaxed constant positive linear dependence constraint qualification and applicationspt_BR
dc.contributor.authorAndreani, Roberto-
dc.contributor.authorHaeser, Gabriel-
dc.contributor.authorSchuverdt, María Laura-
dc.contributor.authorSilva, Paulo J. S.-
dc.subjectProgramação não-linearpt_BR
dc.subject.otherlanguageNonlinear programmingpt_BR
dc.description.abstractIn this work we introduce a relaxed version of the constant positive linear dependence constraint qualification (CPLD) that we call RCPLD. This development is inspired by a recent generalization of the constant rank constraint qualification by Minchenko and Stakhovski that was called RCRCQ. We show that RCPLD is enough to ensure the convergence of an augmented Lagrangian algorithm and that it asserts the validity of an error bound. We also provide proofs and counter-examples that show the relations of RCRCQ and RCPLD with other known constraint qualifications. In particular, RCPLD is strictly weaker than CPLD and RCRCQ, while still stronger than Abadie’s constraint qualification. We also verify that the second order necessary optimality condition holds under RCRCQpt_BR
dc.relation.ispartofMathematical programmingpt_BR
dc.relation.ispartofabbreviationMath. program.pt_BR
dc.publisher.cityHeidelbergpt_BR
dc.publisher.countryAlemanhapt_BR
dc.publisherSpringerpt_BR
dc.date.issued2012-
dc.date.monthofcirculationOct.pt_BR
dc.language.isoengpt_BR
dc.description.volume135pt_BR
dc.description.firstpage255pt_BR
dc.description.lastpage273pt_BR
dc.rightsFechadopt_BR
dc.sourceWOSpt_BR
dc.identifier.issn0025-5610pt_BR
dc.identifier.eissn1436-4646pt_BR
dc.identifier.doi10.1007/s10107-011-0456-0pt_BR
dc.identifier.urlhttps://link.springer.com/article/10.1007%2Fs10107-011-0456-0pt_BR
dc.description.sponsorshipCONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO - CNPQpt_BR
dc.description.sponsorshipFUNDAÇÃO CARLOS CHAGAS FILHO DE AMPARO À PESQUISA DO ESTADO DO RIO DE JANEIRO - FAPERJpt_BR
dc.description.sponsorshipFUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO - FAPESPpt_BR
dc.description.sponsordocumentnumberE-26/171.510/2006-APQ1; 00900/2009-0; 303030/2007-0; 474138/2008-9pt_BR
dc.description.sponsordocumentnumberE-26/171.510/2006-APQ1pt_BR
dc.description.sponsordocumentnumber2006/53768-0; 2009/09414-7pt_BR
dc.date.available2020-08-27T23:46:02Z-
dc.date.accessioned2020-08-27T23:46:02Z-
dc.description.provenanceSubmitted by Thais de Brito Barroso (tbrito@unicamp.br) on 2020-08-27T23:46:02Z No. of bitstreams: 0. Added 1 bitstream(s) on 2021-01-04T15:14:28Z : No. of bitstreams: 1 000308647100009.pdf: 362424 bytes, checksum: 396116bc66d00841334bf3b7fdcb0f21 (MD5)en
dc.description.provenanceMade available in DSpace on 2020-08-27T23:46:02Z (GMT). No. of bitstreams: 0 Previous issue date: 2012en
dc.identifier.urihttp://repositorio.unicamp.br/jspui/handle/REPOSIP/348190-
dc.contributor.departmentDepartamento de Matemática Aplicadapt_BR
dc.contributor.unidadeInstituto de Matemática, Estatística e Computação Científicapt_BR
dc.subject.keywordConstraint qualificationspt_BR
dc.subject.keywordAugmented Lagrangianpt_BR
dc.subject.keywordError bound propertypt_BR
dc.identifier.source000308647100009pt_BR
dc.creator.orcid0000-0003-2031-4325pt_BR
dc.type.formArtigopt_BR
Appears in Collections:IMECC - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
000308647100009.pdf353.93 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.