A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game

DOI10.1016/j.cam.2023.115470zbMath1522.90236MaRDI QIDQ6049293

No author found.

Publication date: 17 October 2023

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

linear complementarity problemsparse solutionlineared subproblemsequential ADMM

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Sparse solutions of linear complementarity problems
• Minimal zero norm solutions of linear complementarity problems
• The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
• A polynomial path-following interior point algorithm for general linear complementarity problems
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
• Global convergence of ADMM in nonconvex nonsmooth optimization
• On the resolution of monotone complementarity problems
• A Newton-type method for positive-semidefinite linear complementarity problems
• A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization
• A shrinkage-thresholding projection method for sparsest solutions of LCPs
• An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
• Compressive Sensing
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• The Linear Complementarity Problem
• On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
• First-Order Methods in Optimization
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• De-noising by soft-thresholding
• On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming
• Minimum norm solution to the positive semidefinite linear complementarity problem
• The Linear Complementarity Problem
• Convex analysis and monotone operator theory in Hilbert spaces
• Complex wavelets for shift invariant analysis and filtering of signals
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

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