Pages that link to "Item:Q2866190"

The following pages link to Subspace accelerated matrix splitting algorithms for asymmetric and symmetric linear complementarity problems (Q2866190):

Displaying 11 items.

• A Gauss-Seidel type solver for the fast computation of input-constrained control systems (Q345014) (← links)
• Primal-dual active-set methods for large-scale optimization (Q493264) (← links)
• Modified modulus-based matrix splitting algorithms for a class of weakly nondifferentiable nonlinear complementarity problems (Q739021) (← links)
• A scalable computational platform for particulate Stokes suspensions (Q781989) (← links)
• An algorithm for the fast solution of symmetric linear complementarity problems (Q998634) (← links)
• A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229) (← links)
• A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization (Q2340521) (← links)
• Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense (Q2672733) (← links)
• The modulus-based matrix splitting algorithms for a class of weakly nonlinear complementarity problems. (Q2829114) (← links)
• A Solver for Nonconvex Bound-Constrained Quadratic Optimization (Q3454512) (← links)
• A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions (Q5348467) (← links)