scientific article; zbMATH DE number 5586189

MaRDI QIDQ5325682zbMATH OpenFDO

Authors Juan Peypouquet

Publication date 24 July 2009

Full work available at URL http://www.heldermann.de/JCA/JCA16/JCA161/jca16015.htm

Mathematics Subject Classification ID

Methods involving semicontinuity and convergence; relaxation (49J45)

Recommendations

• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization
• Asymptotic Convergence Analysis of Some Inexact Proximal Point Algorithms for Minimization
• Asymptotic Convergence Analysis of the Proximal Point Algorithm
• Convergence of diagonally stationary sequences in convex optimization
• Convergence of a proximal point algorithm for solving minimization problems
• Convergence of the proximal point algorithm to approximate solutions of variational inequalities
• Asymptotic regularity and the strong convergence of the proximal point algorithm
• scientific article; zbMATH DE number 854129
• On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems

Cited in

(4)

• From error bounds to the complexity of first-order descent methods for convex functions
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
• A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm
• Coupling the gradient method with a general exterior penalization scheme for convex minimization

This page was built for publication:

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