A sequential ADMM algorithm to find sparse LCP solutions using a l₂-l₁ regularization technique with application in bimatrix game
From MaRDI portal
Publication:6049293
Recommendations
- A shrinkage-thresholding projection method for sparsest solutions of LCPs
- A half thresholding projection algorithm for sparse solutions of LCPs
- Newton hard-thresholding pursuit for sparse linear complementarity problem via a new merit function
- scientific article; zbMATH DE number 7668284
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem
Cites work
- A Newton-type method for positive-semidefinite linear complementarity problems
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A shrinkage-thresholding projection method for sparsest solutions of LCPs
- A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Complex wavelets for shift invariant analysis and filtering of signals
- Compressive Sensing
- Convex analysis and monotone operator theory in Hilbert spaces
- De-noising by soft-thresholding
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods in optimization
- Global convergence of ADMM in nonconvex nonsmooth optimization
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- Minimal zero norm solutions of linear complementarity problems
- Minimum norm solution to the positive semidefinite linear complementarity problem
- On the convergence rate of inexact majorized sGS ADMM with indefinite proximal terms for convex composite programming
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- On the resolution of monotone complementarity problems
- Sparse solutions of linear complementarity problems
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- The Linear Complementarity Problem
- The Linear Complementarity Problem
- The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
Cited in
(6)- A shrinkage-thresholding projection method for sparsest solutions of LCPs
- Extragradient thresholding methods for sparse solutions of co-coercive ncps
- A half thresholding projection algorithm for sparse solutions of LCPs
- Newton hard-thresholding pursuit for sparse linear complementarity problem via a new merit function
- scientific article; zbMATH DE number 7668284 (Why is no real title available?)
- Nonnegative iterative reweighted method for sparse linear complementarity problem
This page was built for publication: A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6049293)
