Ergodic convergence in subgradient optimization with application to simplical decomposition of convex programs

DOI10.1090/CONM/568/11282MaRDI QIDQ2906488zbMATH OpenOpenAlexFDO

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

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) Optimality conditions and duality in mathematical programming (90C46) Minimax problems in mathematical programming (90C47)

Recommendations

• Ergodic convergence in subgradient optimization
• scientific article; zbMATH DE number 1552030
• Ergodic, primal convergence in dual subgradient schemes for convex programming
• Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
• On an ergodic method for a convex optimization problem over the fixed point set
• Subdifferential Convergence in Stochastic Programs
• A generalization of Polyak's convergence result for subgradient optimization
• scientific article; zbMATH DE number 776083
• Ergodic convergence of a stochastic proximal point algorithm
• Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization

Cited in

(3)

• Ergodic convergence in subgradient optimization
• scientific article; zbMATH DE number 1552030 (Why is no real title available?)
• 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 simplical decomposition of convex programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906488)