Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems.

DOI10.1023/A:1017580126509zbMath1064.90048OpenAlexW87963150MaRDI QIDQ5958086

Vaithilingam Jeyakumar, Andreas Fischer, Dinh The Luc

Publication date: 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1017580126509

zbMATH Keywords

nonsmooth analysiscomplementarity problemsApproximate Jacobiansdescent algorithmsnonsmooth continuous maps

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (10)

Merit functions for nonsmooth complementarity problems and related descent algorithms ⋮ The Levenberg-Marquardt-type methods for a kind of vertical complementarity problem ⋮ Global convergence property of modified Levenberg-Marquardt methods for nonsmooth equations. ⋮ On minimizing some merit functions for nonlinear complementarity problems under \(H\) -differentiability ⋮ Convexifactors, generalized convexity and vector optimization ⋮ Convergence analysis of nonmonotone Levenberg-Marquardt algorithms for complementarity problem ⋮ Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs ⋮ Chain rules for approximate Jacobians of continuous functions ⋮ A linearly convergent derivative-free descent method for the second-order cone complementarity problem ⋮ Modified Jacobian smoothing method for nonsmooth complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Solution of monotone complementarity problems with locally Lipschitzian functions
• A penalized Fischer-Burmeister NCP-function
• An open mapping theorem using unbounded generalized Jacobians
• On the resolution of monotone complementarity problems
• On stationary points of the implicit Lagrangian for nonlinear complementarity problems
• Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
• Unconstrained minimization approaches to nonlinear complementarity problems
• A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
• Recession maps and applications
• Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C¹-Optimization
• Approximate Hessian matrices and second-order optimality conditions for nonlinear programming problems with C¹-data
• A special newton-type optimization method
• Variational Analysis
• Engineering and Economic Applications of Complementarity Problems
• A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
• Variational analysis of non-Lipschitz spectral functions

This page was built for publication: Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems.