Boundedness and regularity properties of semismooth reformulations of variational inequalities

DOI10.1007/s10898-005-3842-4zbMath1101.65072OpenAlexW2084324139MaRDI QIDQ2501118

Liqun Qi

Publication date: 4 September 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-005-3842-4

zbMATH Keywords

global convergencevariational inequalitiesLagrangian multipliersquadratic convergencenonlinear complementarity problemnonsingularity conditionsB-subdifferentialClarke's generalized JacobianKarush-Kuhn-TuckerGeneralized Newton methodpseudo-smooth function

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (1)

Convergence analysis of a projection algorithm for variational inequality problems

Cites Work

• Semismooth support vector machines.
• A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
• A nonsmooth version of Newton's method
• Growth behavior of a class of merit functions for the nonlinear complementarity problem
• Regular Pseudo-Smooth NCP and BVIP Functions and Globally and Quadratically Convergent Generalized Newton Methods for Complementarity and Variational Inequality Problems
• A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
• A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
• Nonsmooth Equations: Motivation and Algorithms
• Regularity Properties of a Semismooth Reformulation of Variational Inequalities
• A special newton-type optimization method
• Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
• A Trust Region Method for Solving Generalized Complementarity Problems
• Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods
• Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Two-Step Algorithms for Nonlinear Optimization with Structured Applications
• Global Convergence Analysis of the Generalized Newton and Gauss-Newton Methods of the Fischer-Burmeister Equation for the Complementarity Problem
• Convex Analysis

This page was built for publication: Boundedness and regularity properties of semismooth reformulations of variational inequalities