Ergodic Convergence in Subgradient Optimization with Application to Simplicial Decomposition of Convex Programs

DOI10.1090/conm/568/11282zbMath1275.90058OpenAlexW213091888MaRDI QIDQ2906488

Michael Patriksson, Ann-Brith Strömberg, Torbjörn Larsson

Publication date: 5 September 2012

Published in: Contemporary Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/conm/568/11282

zbMATH Keywords

ergodic convergencesimplicial decompositionnonsmooth minimizationconditional subgradient optimization

Mathematics Subject Classification ID

Convex programming (90C25) Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems

This page was built for publication: Ergodic Convergence in Subgradient Optimization with Application to Simplicial Decomposition of Convex Programs