Sparse solutions of linear complementarity problems
From MaRDI portal
Publication:312696
DOI10.1007/s10107-015-0950-xzbMath1346.90776OpenAlexW2110750017MaRDI QIDQ312696
Publication date: 16 September 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0950-x
Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Portfolio theory (91G10)
Related Items (16)
A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game ⋮ An Optimal Control Problem with Terminal Stochastic Linear Complementarity Constraints ⋮ A Parallel Iterative Algorithm for Differential Linear Complementarity Problems ⋮ Conic formulation of QPCCs applied to truly sparse QPs ⋮ Lifted stationary points of sparse optimization with complementarity constraints ⋮ Sparse Markowitz portfolio selection by using stochastic linear complementarity approach ⋮ Preconditioned ADMM for a class of bilinear programming problems ⋮ Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation ⋮ A Gauss--Seidel Type Method for Dynamic Nonlinear Complementarity Problems ⋮ Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem ⋮ The sparsest solutions to \(Z\)-tensor complementarity problems ⋮ Lagrangian duality and saddle points for sparse linear programming ⋮ The sparsest solution of the union of finite polytopes via its nonconvex relaxation ⋮ A linearly convergent iterative method for identifying H-matrices ⋮ A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation ⋮ Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
Cites Work
- Unnamed Item
- A mathematical introduction to compressive sensing
- Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints
- A note on the complexity of \(L _{p }\) minimization
- Sufficient matrices and the linear complementarity problem
- On local \(w\)-uniqueness of solutions to linear complementarity problem
- On homogeneous and self-dual algorithms for LCP
- Newton iterations in implicit time-stepping scheme for differential linear complementarity systems
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- Convergence of Time-Stepping Schemes for Passive and Extended Linear Complementarity Systems
- Sparse and stable Markowitz portfolios
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Engineering and Economic Applications of Complementarity Problems
- Sparse Approximate Solutions to Linear Systems
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- A Probelm in Linear Inequalities
This page was built for publication: Sparse solutions of linear complementarity problems
