Pages that link to "Item:Q312696"
From MaRDI portal
The following pages link to Sparse solutions of linear complementarity problems (Q312696):
Displaying 16 items.
- The sparsest solutions to \(Z\)-tensor complementarity problems (Q519760) (← links)
- A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation (Q778434) (← links)
- Sparse Markowitz portfolio selection by using stochastic linear complementarity approach (Q1716964) (← links)
- Preconditioned ADMM for a class of bilinear programming problems (Q1721110) (← links)
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem (Q1993073) (← links)
- Lagrangian duality and saddle points for sparse linear programming (Q2010427) (← links)
- Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation (Q2220667) (← links)
- The sparsest solution of the union of finite polytopes via its nonconvex relaxation (Q2311128) (← links)
- Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)
- Lifted stationary points of sparse optimization with complementarity constraints (Q2696930) (← links)
- A Parallel Iterative Algorithm for Differential Linear Complementarity Problems (Q4600004) (← links)
- Sparse Solutions by a Quadratically Constrained ℓq (0 <<i>q</i>< 1) Minimization Model (Q4995085) (← links)
- A Gauss--Seidel Type Method for Dynamic Nonlinear Complementarity Problems (Q5136745) (← links)
- A linearly convergent iterative method for identifying H-matrices (Q5240730) (← links)
- A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game (Q6049293) (← links)
- An Optimal Control Problem with Terminal Stochastic Linear Complementarity Constraints (Q6071809) (← links)
