Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
type: Item
instance of: scholarly article
title: Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
zbMATH Open document ID: 1131.65050
author: Zhenghai Huang
published in: Applied Mathematics and Computation
publication date: 2005-02-23T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 2137749
zbMATH Keywords: semidefinite complementarity problem
zbMATH Keywords: nonlinear complementarity problem
zbMATH Keywords: global error bound
zbMATH Keywords: local error bound
zbMATH Keywords: Lipschitzian error bound
MaRDI profile type: Publication
full work available at URL: j.amc.2004.03.005
OpenAlex ID: W2066627837
cites work: Stability and regular points of inequality systems
cites work: On the Identification of Active Constraints II: The Nonconvex Case
cites work: Weak Sharp Minima in Mathematical Programming
cites work: Error bounds for \(R_0\)-type and monotone nonlinear complementarity problems.
cites work: Smooth Approximations to Nonlinear Complementarity Problems
cites work: Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
cites work: Non-interior continuation methods for solving semidefinite complementarity problems
cites work: On the Accurate Identification of Active Constraints
cites work: Finite termination of the proximal point algorithm
cites work: Minimum principle sufficiency
cites work: Non-interior continuation method for solving the monotone semidefinite complementarity problem
cites work: Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
cites work: Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
cites work: Q4257334
cites work: Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
cites work: Error bounds and convergence analysis of feasible descent methods: A general approach
cites work: Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
cites work: New improved error bounds for the linear complementarity problem
cites work: Inexact Newton methods for the nonlinear complementarity problem
cites work: Error bounds in mathematical programming
cites work: Regularity and Stability for Convex Multivalued Functions
cites work: Merit functions for semi-definite complementarity problems
cites work: Q4252834
cites work: Q2765625
DOI: 10.1016/J.AMC.2004.03.005
Recommended article: Global \(s\)-type error bound for the extended linear complementarity problem and applications.
Recommended article: On a global projection-type error bound for the linear complementarity problem
Recommended article: Global error bound estimation for the generalized nonlinear complementarity problem over a closed convex cone
Recommended article: Computable error bounds for semidefinite programming
Recommended article: New global error bound for extended linear complementarity problems
Recommended article: Global error bound for the generalized linear complementarity problem over a polyhedral cone
Recommended article: Error bounds for generalized Lagrange multipliers in locally Lipschitz programming
Recommended article: Q4848956
Recommended article: A Lipschitzian error bound for monotone symmetric cone linear complementarity problem
description: scientific article; zbMATH DE number 2137749