Pages that link to "Item:Q4697313"
From MaRDI portal
The following pages link to Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem (Q4697313):
Displaying 12 items.
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
- Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
- Gauss-Seidel method for least-distance problems (Q1321271) (← links)
- Error bounds for inconsistent linear inequalities and programs (Q1342080) (← links)
- Descent methods with linesearch in the presence of perturbations (Q1360171) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- Convergence analysis of perturbed feasible descent methods (Q1379956) (← links)
- Some recent advances in projection-type methods for variational inequalities (Q1872978) (← links)
- On linear convergence of iterative methods for the variational inequality problem (Q1900764) (← links)
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957) (← links)
- Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization (Q2355319) (← links)
- Bounded perturbation resilience of projected scaled gradient methods (Q5963677) (← links)
