Numerical comparisons of two effective methods for mixed complementarity problems
DOI10.1016/J.CAM.2010.01.004zbMATH Open1223.90069OpenAlexW2069625751MaRDI QIDQ966077FDOQ966077
Authors: Ching-Yu Yang, Jein-Shan Chen, Shaohua Pan 
Publication date: 27 April 2010
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.01.004
Recommendations
- A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs
- On the generalized fischer-burmeister merit function for the second-order cone complementarity problem
- A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs
- ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
- A family of NCP functions and a descent method for the nonlinear complementarity problem
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- QPCOMP: A quadratic programming based solver for mixed complementarity problems
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A nonsmooth version of Newton's method
- Title not available (Why is that?)
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- A Nonmonotone Line Search Technique for Newton’s Method
- Engineering and Economic Applications of Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- Solution of monotone complementarity problems with locally Lipschitzian functions
- A comparison of large scale mixed complementarity problem solvers
- ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- Feasible descent algorithms for mixed complementarity problems
- Strictly feasible equation-based methods for mixed complementarity problems
- Nonsmooth Equations: Motivation and Algorithms
- On a semismooth least squares formulation of complementarity problems with gap reduction
- Global Methods for Nonlinear Complementarity Problems
- Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
- An inexact QP-based method for nonlinear complementarity problems
- Title not available (Why is that?)
Cited In (4)
- Symmetrization of generalized natural residual function for NCP
- A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs
- On the generalized fischer-burmeister merit function for the second-order cone complementarity problem
- Discovery of new complementarity functions for NCP and SOCCP
Uses Software
This page was built for publication: Numerical comparisons of two effective methods for mixed complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966077)
