Pages that link to "Item:Q5387958"

The following pages link to Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization (Q5387958):

Displaying 8 items.

• Dual convergence for penalty algorithms in convex programming (Q430935) (← links)
• A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method (Q467410) (← links)
• A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm (Q3577847) (← links)
• On the Convergence of the Proximal Point Algorithm for Convex Minimization (Q3978027) (← links)
• Hybrid Moreau’s Proximal Algorithms and Convergence Theorems for Minimization Problems in Hilbert Spaces with Applications (Q4622805) (← links)
• Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods (Q4916327) (← links)
• On the convergence rate of customized proximal point algorithm for convex optimization and saddle-point problem (Q5017754) (← links)
• (Q5861875) (← links)