Pages that link to "Item:Q4017642"
From MaRDI portal
The following pages link to Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem (Q4017642):
Displaying 16 items.
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
- A modified damped Newton method for linear complementarity problems (Q857647) (← links)
- An inexact NE/SQP method for solving the nonlinear complementarity problem (Q1202586) (← links)
- Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
- Gauss-Seidel method for least-distance problems (Q1321271) (← links)
- Descent methods with linesearch in the presence of perturbations (Q1360171) (← links)
- Convergence analysis of perturbed feasible descent methods (Q1379956) (← links)
- Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results (Q1803603) (← 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)
- Distributed Newton methods for strictly convex consensus optimization problems in multi-agent networks (Q2333555) (← links)
- On the convergence of iterative methods for symmetric linear complementarity problems (Q2366607) (← links)
- Inexact multisplitting methods for linear complementarity problems (Q2378248) (← links)
- A modified modulus method for symmetric positive-definite linear complementarity problems (Q3011668) (← links)
- Parallel algorithm for support vector machines training and quadratic optimization problems (Q5317755) (← links)
- Bounded perturbation resilience of projected scaled gradient methods (Q5963677) (← links)
