Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization

DOI10.1287/MOOR.1050.0156zbMath1278.90306OpenAlexW2130045969MaRDI QIDQ5387958

Miguel Carrasco, K. Pichard, Felipe Alvarez

Publication date: 27 May 2008

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/175912

zbMATH Keywords

global convergencehybrid methodproximal pointparametric approximationdiagonal iteration

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (3)

Dual convergence for penalty algorithms in convex programming ⋮ Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods ⋮ A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm

This page was built for publication: Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization