Pages that link to "Item:Q1321811"
From MaRDI portal
The following pages link to A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems (Q1321811):
Displaying 17 items.
- A family of second-order methods for convex \(\ell _1\)-regularized optimization (Q312690) (← links)
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework (Q742122) (← links)
- The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix (Q781116) (← links)
- On the convergence of the block principal pivotal algorithm for the LCP (Q1290721) (← links)
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
- Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem (Q2010729) (← links)
- A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem (Q2023685) (← links)
- A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix (Q2059678) (← links)
- Revisiting augmented Lagrangian duals (Q2097636) (← links)
- The reduced order method for solving the linear complementarity problem with an \(M\)-matrix (Q2172919) (← links)
- Regularization of inverse problems via box constrained minimization (Q2188146) (← links)
- Optimal non-negative forecast reconciliation (Q2209697) (← links)
- A class of mathematical programs with equilibrium constraints: a smooth algorithm and applications to contact problems (Q2575248) (← links)
- A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds (Q2945124) (← links)
- Error estimates for the approximation of some unilateral problems (Q4130920) (← links)
- An alternating direction method of multipliers for the eigenvalue complementarity problem (Q4999333) (← links)
- Splitting methods for the Eigenvalue Complementarity Problem (Q5238067) (← links)