Extragradient thresholding methods for sparse solutions of co-coercive ncps

DOI10.1186/S13660-015-0551-5MaRDI QIDQ2260937zbMATH OpenOpenAlexWikidataFDO

Authors Meijuan Shang, Sheng-Long Zhou, Naihua Xiu

Publication date 12 March 2015

Published in Journal of Inequalities and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1186/s13660-015-0551-5

zbMATH Keywords

convergencenonlinear complementarity problemssparse solutionextragradientco-coercive\(\ell_{1}\)~relaxation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

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
• Sparse solutions of linear complementarity problems
• A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game

Cites work

• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• A modified projection method with a new direction for solving variational inequalities
• A simple proof for some important properties of the projection mapping
• An EM algorithm for wavelet-based image restoration
• An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities
• Compressed sensing
• Exact matrix completion via convex optimization
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Highly Robust Error Correction byConvex Programming
• Improvements of some projection methods for monotone nonlinear variational inequalities
• Mathematical Programs with Equilibrium Constraints
• Minimal zero norm solutions of linear complementarity problems
• New reformulations for stochastic nonlinear complementarity problems
• Randomized portfolio selection, with constraints
• Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
• Stable signal recovery from incomplete and inaccurate measurements

Cited in

(4)

• Newton method for \(\ell_0\)-regularized optimization
• An effective smoothing Newton projection algorithm for finding sparse solutions to NP-hard tensor complementarity problems
• Newton hard-thresholding pursuit for sparse linear complementarity problem via a new merit function
• A half thresholding projection algorithm for sparse solutions of LCPs

This page was built for publication: Extragradient thresholding methods for sparse solutions of co-coercive ncps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2260937)