Dual Convergence for Penalty Algorithms in Convex Programming

Felipe ÁlvarezMiguel CarrascoThierry Champion2026-03-222026-03-22201110.1007/s10957-011-9967-3https://doi.org/10.1007/s10957-011-9967-3https://andeanlibrary.org/handle/123456789/62548enMathematicsSequence (biology)Theory of computationMathematical optimizationPenalty methodLimit pointIterated functionUniquenessNonlinear complementarity problemBounded functionDual Convergence for Penalty Algorithms in Convex Programmingarticle