Numerical comparisons of two effective methods for mixed complementarity problems
From MaRDI portal
Publication:966077
DOI10.1016/j.cam.2010.01.004zbMath1223.90069OpenAlexW2069625751MaRDI QIDQ966077
Ching-Yu Yang, Shaohua Pan, Jein-Shan Chen
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
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)
Related Items
Discovery of new complementarity functions for NCP and SOCCP, On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem, A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs, Symmetrization of generalized natural residual function for NCP
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- An inexact QP-based method for nonlinear complementarity problems
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- QPCOMP: A quadratic programming based solver for mixed complementarity problems
- A comparison of large scale mixed complementarity problem solvers
- Feasible descent algorithms for mixed complementarity problems
- A nonsmooth version of Newton's method
- Nonsmooth Equations: Motivation and Algorithms
- Engineering and Economic Applications of Complementarity Problems
- On a semismooth least squares formulation of complementarity problems with gap reduction
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Global Methods for Nonlinear Complementarity Problems
- A Nonmonotone Line Search Technique for Newton’s Method
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
- Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
- Strictly feasible equation-based methods for mixed complementarity problems
- Benchmarking optimization software with performance profiles.
