dc.creatorAndreani, R
dc.creatorJudice, JJ
dc.creatorMartinez, JM
dc.creatorPatricio, J
dc.date2011
dc.dateNOV
dc.date2014-07-30T17:53:04Z
dc.date2015-11-26T16:46:16Z
dc.date2014-07-30T17:53:04Z
dc.date2015-11-26T16:46:16Z
dc.date.accessioned2018-03-28T23:32:04Z
dc.date.available2018-03-28T23:32:04Z
dc.identifierMathematical Programming. Springer, v. 130, n. 1, n. 211, n. 223, 2011.
dc.identifier0025-5610
dc.identifierWOS:000295785100009
dc.identifier10.1007/s10107-009-0336-z
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/68720
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/68720
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1274466
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.descriptionComplementarity problems may be formulated as nonlinear systems of equations with non-negativity constraints. The natural merit function is the sum of squares of the components of the system. Sufficient conditions are established which guarantee that stationary points are solutions of the complementarity problem. Algorithmic consequences are discussed.
dc.description130
dc.description1
dc.description211
dc.description223
dc.descriptionPortuguese Science and Technology Foundation [POCI/MAT/56704/2004]
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.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionPortuguese Science and Technology Foundation [POCI/MAT/56704/2004]
dc.languageen
dc.publisherSpringer
dc.publisherNew York
dc.publisherEUA
dc.relationMathematical Programming
dc.relationMath. Program.
dc.rightsfechado
dc.rightshttp://www.springer.com/open+access/authors+rights?SGWID=0-176704-12-683201-0
dc.sourceWeb of Science
dc.subjectComplementarity Problems
dc.subjectMerit functions
dc.subjectNonlinear Programming
dc.subjectProjected Gradient Methods
dc.subjectVariational-inequalities
dc.subjectNonlinear Complementarity
dc.subjectConstrained Minimization
dc.subjectSmooth Optimization
dc.subjectConvex-sets
dc.subjectReformulation
dc.subjectAlgorithm
dc.subjectLcp
dc.titleOn the natural merit function for solving complementarity problems
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución