Pages that link to "Item:Q5110325"

The following pages link to Convergence rate of a relaxed inertial proximal algorithm for convex minimization (Q5110325):

Displaying 12 items.

• On convergence and complexity analysis of an accelerated forward-backward algorithm with linesearch technique for convex minimization problems and applications to data prediction and classification (Q2072932) (← links)
• Convergence results of two-step inertial proximal point algorithm (Q2085649) (← links)
• Relaxed inertial methods for solving split variational inequality problems without product space formulation (Q2161509) (← links)
• Shrinking projection methods for accelerating relaxed inertial Tseng-type algorithm with applications (Q2214800) (← links)
• Relaxed-inertial proximal point type algorithms for quasiconvex minimization (Q2689858) (← links)
• (Q4995610) (← links)
• Weak and linear convergence of a generalized proximal point algorithm with alternating inertial steps for a monotone inclusion problem (Q5089998) (← links)
• Relaxed inertial Tseng extragradient method for variational inequality and fixed point problems (Q6055915) (← links)
• Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability (Q6161546) (← links)
• Generalized proximal point algorithms with correction terms and extrapolation (Q6536963) (← links)
• Modified accelerated Bregman projection methods for solving quasi-monotone variational inequalities (Q6565285) (← links)
• Proximal point type algorithms with relaxed and inertial effects beyond convexity (Q6632226) (← links)