Newton Hard-Thresholding Pursuit for Sparse Linear Complementarity Problem via A New Merit Function
From MaRDI portal
Publication:5857635
DOI10.1137/19M1301539zbMath1462.90144arXiv2004.02244OpenAlexW3134972862MaRDI QIDQ5857635
Li-Li Pan, Meijuan Shang, Sheng-Long Zhou, Mu Li
Publication date: 1 April 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.02244
linear complementarity problemssparsity constrained optimizationnew merit functionNewton hard threshodling pursuit
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On solutions of sparsity constrained optimization
- Minimal zero norm solutions of linear complementarity problems
- A half thresholding projection algorithm for sparse solutions of LCPs
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- A modified projection method with a new direction for solving variational inequalities
- A note on a globally convergent Newton method for solving monotone variational inequalities
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- Nonlinear complementarity as unconstrained and constrained minimization
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
- A semismooth equation approach to the solution of nonlinear complementarity problems
- New NCP-functions and their properties
- A penalized Fischer-Burmeister NCP-function
- On the resolution of monotone complementarity problems
- On stationary points of the implicit Lagrangian for nonlinear complementarity problems
- Nonlinear complementarity as unconstrained optimization
- Extragradient thresholding methods for sparse solutions of co-coercive ncps
- Optimality conditions for sparse nonlinear programming
- A globally convergent Newton method for solving strongly monotone variational inequalities
- Coerciveness of some merit functions over symmetric cones
- A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- The Linear Complementarity Problem
- Generalized Gradients and Applications
- A special newton-type optimization method
- Smooth Approximations to Nonlinear Complementarity Problems
- Variational Analysis
- Global Methods for Nonlinear Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem
- Improvements of some projection methods for monotone nonlinear variational inequalities
