Dual Convergence for Penalty Algorithms in Convex Programming

Simple item page
dc.contributor.authorFelipe Álvarez
dc.contributor.authorMiguel Carrasco
dc.contributor.authorThierry Champion
dc.coverage.spatialBolivia
dc.date.accessioned2026-03-22T17:09:53Z
dc.date.available2026-03-22T17:09:53Z
dc.date.issued2011
dc.identifier.doi10.1007/s10957-011-9967-3
dc.identifier.urihttps://doi.org/10.1007/s10957-011-9967-3
dc.identifier.urihttps://andeanlibrary.org/handle/123456789/62548
dc.language.isoen
dc.publisherSpringer Science+Business Media
dc.relation.ispartofJournal of Optimization Theory and Applications
dc.sourceUniversity of Chile
dc.subjectMathematics
dc.subjectSequence (biology)
dc.subjectTheory of computation
dc.subjectMathematical optimization
dc.subjectPenalty method
dc.subjectLimit point
dc.subjectIterated function
dc.subjectUniqueness
dc.subjectNonlinear complementarity problem
dc.subjectBounded function
dc.titleDual Convergence for Penalty Algorithms in Convex Programming
dc.typearticle

Files

Collections

Artículo Científico Publicado