On a semismooth least squares formulation of complementarity problems with gap reduction

DOI10.1080/10556780410001683096zbMath1097.90062OpenAlexW2164249077MaRDI QIDQ4657705

Stefania Petra, Christian Kanzow

Publication date: 14 March 2005

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780410001683096

zbMATH Keywords

global convergencequadratic convergencecomplementarity problemssemismooth functionsnonlinear least squares reformulation

Mathematics Subject Classification ID

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

Related Items

Convex piecewise-linear fitting, Exact penalties for variational inequalities with applications to nonlinear complementarity problems, A locally convergent inexact projected Levenberg-Marquardt-type algorithm for large-scale constrained nonsmooth equations, Nonsmooth Levenberg-Marquardt type method for solving a class of stochastic linear complementarity problems with finitely many elements, A new semismooth Newton method for NCPs based on the penalized KK function, A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs, A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods, A smoothing Levenberg-Marquardt method for the extended linear complementarity problem, Numerical comparisons of two effective methods for mixed complementarity problems, An efficient algorithm for solving supply chain network equilibria and equivalent supernetwork based traffic network equilibria, Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems, A self-adaptive trust region method for the extended linear complementarity problems, A smoothing least square method for nonlinear complementarity problem

Uses Software

• MCPLIB

Cites Work

• On NCP-functions
• Nonlinear complementarity as unconstrained and constrained minimization
• Solution of monotone complementarity problems with locally Lipschitzian functions
• A semismooth equation approach to the solution of nonlinear complementarity problems
• New NCP-functions and their properties
• On the resolution of monotone complementarity problems
• Feasible descent algorithms for mixed complementarity problems
• A nonsmooth version of Newton's method
• On P- and S-functions and related classes of \(n\)-dimensional nonlinear mappings
• Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
• A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
• Nonsmooth Equations: Motivation and Algorithms
• Computing a Trust Region Step
• Strongly Regular Generalized Equations
• A special newton-type optimization method
• Engineering and Economic Applications of Complementarity Problems
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• A Nonmonotone Line Search Technique for Newton’s Method
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Global Convergence Analysis of the Generalized Newton and Gauss-Newton Methods of the Fischer-Burmeister Equation for the Complementarity Problem