Pages that link to "Item:Q2247898"

The following pages link to The proximal point algorithm revisited (Q2247898):

Displaying 27 items.

• A note on the complexity of proximal iterative hard thresholding algorithm (Q259117) (← links)
• Douglas-Rachford splitting method for semidefinite programming (Q295495) (← links)
• Revisit the over-relaxed proximal point algorithm (Q311711) (← links)
• Convergence of a proximal point algorithm for solving minimization problems (Q442796) (← links)
• Comments on ``The proximal point algorithm revisited'' (Q493256) (← links)
• New inertial factors of the Krasnosel'skiĭ-Mann iteration (Q829879) (← links)
• On the proximal point algorithm (Q946191) (← links)
• Proximal-point algorithm using a linear proximal term (Q1028604) (← links)
• Metric subregularity and the proximal point method (Q1034588) (← links)
• Finite termination of the proximal point algorithm (Q1176570) (← links)
• A proximal point algorithm for minimax problems (Q1371666) (← links)
• An abstract proximal point algorithm (Q1630279) (← links)
• Finding Dantzig selectors with a proximity operator based fixed-point algorithm (Q1663200) (← links)
• Forcing strong convergence of proximal point iterations in a Hilbert space (Q1970303) (← links)
• Weak convergence of an extended splitting method for monotone inclusions (Q2022232) (← links)
• The developments of proximal point algorithms (Q2158107) (← links)
• A Halpern-type iteration method for Bregman nonspreading mapping and monotone operators in reflexive Banach spaces (Q2300001) (← links)
• A proximal point algorithm with asymmetric linear term (Q2311109) (← links)
• Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces (Q2419566) (← links)
• The proximal point algorithm for the \(P_0\) complementarity problem (Q2760114) (← links)
• Algorithms with new parameter conditions for split variational inclusion problems in Hilbert spaces with application to split feasibility problem (Q2810098) (← links)
• On the convergence of the forward–backward splitting method with linesearches (Q2829582) (← links)
• A proximal algorithm with quasi distance. Application to habit's formation (Q3145052) (← links)
• A Generalization of the Proximal Point Algorithm (Q3477576) (← links)
• How good are the proximal point algorithms? (Q3777808) (← links)
• (Q4957149) (← links)
• Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations (Q5231367) (← links)