Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs

DOI10.1016/j.amc.2004.03.005zbMath1131.65050OpenAlexW2066627837MaRDI QIDQ1765864

Zheng-Hai Huang

Publication date: 23 February 2005

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

Full work available at URL: https://doi.org/10.1016/j.amc.2004.03.005

zbMATH Keywords

nonlinear complementarity problemglobal error boundlocal error boundsemidefinite complementarity problemLipschitzian error bound

Mathematics Subject Classification ID

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

Related Items (1)

Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability and regular points of inequality systems
• Finite termination of the proximal point algorithm
• Minimum principle sufficiency
• Merit functions for semi-definite complementarity problems
• Error bounds and convergence analysis of feasible descent methods: A general approach
• New improved error bounds for the linear complementarity problem
• Error bounds in mathematical programming
• Non-interior continuation methods for solving semidefinite complementarity problems
• Non-interior continuation method for solving the monotone semidefinite complementarity problem
• Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
• Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
• Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
• Weak Sharp Minima in Mathematical Programming
• On the Identification of Active Constraints II: The Nonconvex Case
• Regularity and Stability for Convex Multivalued Functions
• Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
• On the Accurate Identification of Active Constraints
• Smooth Approximations to Nonlinear Complementarity Problems
• Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
• Inexact Newton methods for the nonlinear complementarity problem
• Error bounds for \(R_0\)-type and monotone nonlinear complementarity problems.

This page was built for publication: Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs