On a semismooth least squares formulation of complementarity problems with gap reduction
DOI10.1080/10556780410001683096zbMATH Open1097.90062OpenAlexW2164249077MaRDI QIDQ4657705FDOQ4657705
Stefania Petra, Christian Kanzow
Publication date: 14 March 2005
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780410001683096
Recommendations
- A smoothing least squares method for nonlinear complementarity problem
- A least-square semismooth Newton method for the second-order cone complementarity problem
- A semismooth equation approach to the solution of nonlinear complementarity problems
- An almost smooth equation reformulation to the nonlinear complementarity problem and Newton's method
- An SQP method for general nonlinear complementarity problems
global convergencequadratic convergencecomplementarity problemssemismooth functionsnonlinear least squares reformulation
Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Computing a Trust Region Step
- A nonsmooth version of Newton's method
- Strongly Regular Generalized Equations
- 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
- A semismooth equation approach to the solution of nonlinear complementarity problems
- Engineering and Economic Applications of Complementarity Problems
- On NCP-functions
- Solution of monotone complementarity problems with locally Lipschitzian functions
- New NCP-functions and their properties
- On the resolution of monotone complementarity problems
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A special newton-type optimization method
- Feasible descent algorithms for mixed complementarity problems
- Nonsmooth Equations: Motivation and Algorithms
- Nonlinear complementarity as unconstrained and constrained minimization
- Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems
- On P- and S-functions and related classes of \(n\)-dimensional nonlinear mappings
- Global Convergence Analysis of the Generalized Newton and Gauss-Newton Methods of the Fischer-Burmeister Equation for the Complementarity Problem
Cited In (14)
- A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs
- 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
- A locally convergent inexact projected Levenberg-Marquardt-type algorithm for large-scale constrained nonsmooth equations
- A smoothing Levenberg-Marquardt method for the extended linear complementarity problem
- A self-adaptive trust region method for the extended linear complementarity problems
- The Levenberg-Marquardt method: an overview of modern convergence theories and more
- A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods
- Convex piecewise-linear fitting
- Exact penalties for variational inequalities with applications to nonlinear complementarity problems
- A smoothing least squares method for nonlinear complementarity problem
- Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
- 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
Uses Software
This page was built for publication: On a semismooth least squares formulation of complementarity problems with gap reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657705)
