Minimal zero norm solutions of linear complementarity problems
DOI10.1007/S10957-014-0549-ZzbMATH Open1336.90092OpenAlexW2008783287MaRDI QIDQ481048FDOQ481048
Authors: Meijuan Shang, Chao Zhang, Naihua Xiu 
Publication date: 12 December 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0549-z
Recommendations
- Sparse solutions of linear complementarity problems
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem
- scientific article; zbMATH DE number 7668284
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- A shrinkage-thresholding projection method for sparsest solutions of LCPs
linear complementarity problems\(Z\)-matrix: \(\ell_p\) regularized minimizationminimal \(\ell_0\) norm solutionssequential smoothing gradient method
Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
- Title not available (Why is that?)
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Sparse Approximate Solutions to Linear Systems
- A note on the complexity of \(L _{p }\) minimization
- Mathematical Programs with Equilibrium Constraints
- Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
- New reformulations for stochastic nonlinear complementarity problems
- An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints
- Complementarity: applications, algorithms and extensions. Papers from the international conference on complementarity (ICCP 99), Madison, WI, USA, June 9--12, 1999
- The Optimal Selection of Small Portfolios
- Randomized portfolio selection, with constraints
- On sparse approximations to randomized strategies and convex combinations
- Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
Cited In (16)
- Newton method for \(\ell_0\)-regularized optimization
- A linearly convergent iterative method for identifying H-matrices
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem
- Nonnegative iterative reweighted method for sparse linear complementarity problem
- An effective smoothing Newton projection algorithm for finding sparse solutions to NP-hard tensor complementarity problems
- Lagrangian duality and saddle points for sparse linear programming
- A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game
- Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints
- Newton hard-thresholding pursuit for sparse linear complementarity problem via a new merit function
- The sparsest solutions to \(Z\)-tensor complementarity problems
- Sparse solutions of linear complementarity problems
- Extragradient thresholding methods for sparse solutions of co-coercive ncps
- Minimal realization in the max algebra is an extended linear complementarity problem
- A half thresholding projection algorithm for sparse solutions of LCPs
- Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations
- The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
This page was built for publication: Minimal zero norm solutions of linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q481048)
