Pages that link to "Item:Q890114"
From MaRDI portal
The following pages link to iPiasco: inertial proximal algorithm for strongly convex optimization (Q890114):
Displaying 12 items.
- (Q5860518) (← links)
- Weak convergence for variational inequalities with inertial-type method (Q5862274) (← links)
- Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems (Q5863523) (← links)
- Self-Adaptive Inertial Projection and Contraction Algorithm for Monotone Variational Inequality (Q5865921) (← links)
- FISTA is an automatic geometrically optimized algorithm for strongly convex functions (Q6120847) (← links)
- A new proximal heavy ball inexact line-search algorithm (Q6541375) (← links)
- Convergence analysis of a new relaxed algorithm with inertial for solving split feasibility problems (Q6576143) (← links)
- An inertial proximal splitting method with applications (Q6606313) (← links)
- Acceleration algorithms for iterative methods (Q6608662) (← links)
- Parameter-free FISTA by adaptive restart and backtracking (Q6622751) (← links)
- A class of accelerated GADMM-based method for multi-block nonconvex optimization problems (Q6664399) (← links)
- An improved inertial alternating direction method for low rank matrix completion problems (Q6665355) (← links)