New global error bound for extended linear complementarity problems
From MaRDI portal
Publication:824801
DOI10.1186/s13660-018-1847-zzbMath1498.90233OpenAlexW2890993070WikidataQ58701107 ScholiaQ58701107MaRDI QIDQ824801
Hongchun Sun, Min Sun, Y. J. Wang
Publication date: 15 December 2021
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-018-1847-z
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Linear equations (linear algebraic aspects) (15A06)
Related Items
Lifted stationary points of sparse optimization with complementarity constraints, An improvement on the global error bound estimation for ELCP and its applications
Cites Work
- Existence-stability theorems for strong vector set-valued equilibrium problems in reflexive Banach spaces
- Generalized strict feasibility and solvability for generalized vector equilibrium problem with set-valued map in reflexive Banach spaces
- Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone
- Some new error bounds for linear complementarity problems of H-matrices
- Error bounds for linear complementarity problems of Nekrasov matrices
- Global error bounds for the extended vertical LCP
- An alternative extragradient projection method for quasi-equilibrium problems
- Global error bound for the generalized linear complementarity problem over a polyhedral cone
- Error bounds in mathematical programming
- Global \(s\)-type error bound for the extended linear complementarity problem and applications.
- On the extended linear complementarity problem
- A smoothing inexact Newton method for \(P_0\) nonlinear complementarity problem
- A sharper global error bound for the generalized nonlinear complementarity problem over a polyhedral cone
- Strong convergence of extragradient method for generalized variational inequalities in Hilbert space
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
- A family of conjugate gradient methods for large-scale nonlinear equations
- A smoothing Newton-type method for generalized nonlinear complementarity problem
- Computation of error bounds for P-matrix linear complementarity problems
- New error bounds for the linear complementarity problem with an \(SB\)-matrix
- Componentwise error bounds for linear complementarity problems
- Engineering and Economic Applications of Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- The Extended Linear Complementarity Problem
