Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
From MaRDI portal
Publication:4785906
DOI10.1137/S1052623401397242zbMath1049.90056MaRDI QIDQ4785906
Roberto Cominetti, Matias Courdurier
Publication date: 5 January 2003
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Related Items
Coupling the gradient method with a general exterior penalization scheme for convex minimization, Dual convergence for penalty algorithms in convex programming, Steepest descent with curvature dynamical system, Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's, Computing proximal points of nonconvex functions, Asymptotic almost-equivalence of Lipschitz evolution systems in Banach spaces