Minimal zero norm solutions of linear complementarity problems
From MaRDI portal
Publication:481048
DOI10.1007/s10957-014-0549-zzbMath1336.90092OpenAlexW2008783287MaRDI QIDQ481048
Meijuan Shang, Chao Zhang, Nai-Hua 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
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)
Related Items
Newton method for \(\ell_0\)-regularized optimization, A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game, Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations, A half thresholding projection algorithm for sparse solutions of LCPs, Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem, The sparsest solutions to \(Z\)-tensor complementarity problems, Extragradient thresholding methods for sparse solutions of co-coercive ncps, Lagrangian duality and saddle points for sparse linear programming, A linearly convergent iterative method for identifying H-matrices, Newton Hard-Thresholding Pursuit for Sparse Linear Complementarity Problem via A New Merit Function
Cites Work
- Unnamed Item
- Unnamed Item
- A note on the complexity of \(L _{p }\) minimization
- On sparse approximations to randomized strategies and convex combinations
- An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
- 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
- Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
- The Optimal Selection of Small Portfolios
- Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Sparse Approximate Solutions to Linear Systems
- New reformulations for stochastic nonlinear complementarity problems
- Mathematical Programs with Equilibrium Constraints
- Complementarity: applications, algorithms and extensions. Papers from the international conference on complementarity (ICCP 99), Madison, WI, USA, June 9--12, 1999
