Numerical comparisons of two effective methods for mixed complementarity problems
type: Item
instance of: scholarly article
title: Numerical comparisons of two effective methods for mixed complementarity problems
zbMATH Open document ID: 1223.90069
author: Ching-Yu Yang
author: Jein-Shan Chen
author: Shaohua Pan
published in: Journal of Computational and Applied Mathematics
publication date: 2010-04-27T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 65K15
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 5702028
zbMATH Keywords: MCP
zbMATH Keywords: the generalized FB function
zbMATH Keywords: semismooth
zbMATH Keywords: convergence rate
describes a project that uses: QPCOMP
describes a project that uses: MCPLIB
MaRDI profile type: Publication
full work available at URL: j.cam.2010.01.004
OpenAlex ID: W2069625751
cites work: Q4003375
cites work: Engineering and Economic Applications of Complementarity Problems
cites work: Q4495124
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: A comparison of large scale mixed complementarity problem solvers
cites work: QPCOMP: A quadratic programming based solver for mixed complementarity problems
cites work: Feasible descent algorithms for mixed complementarity problems
cites work: Strictly feasible equation-based methods for mixed complementarity problems
cites work: On a semismooth least squares formulation of complementarity problems with gap reduction
cites work: Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: An inexact QP-based method for nonlinear complementarity problems
cites work: Global Methods for Nonlinear Complementarity Problems
cites work: NE/SQP: A robust algorithm for the nonlinear complementarity problem
cites work: The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
cites work: ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
cites work: A family of NCP functions and a descent method for the nonlinear complementarity problem
cites work: Benchmarking optimization software with performance profiles.
cites work: Q4000274
cites work: Nonsmooth Equations: Motivation and Algorithms
cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
cites work: A nonsmooth version of Newton's method
cites work: Solution of monotone complementarity problems with locally Lipschitzian functions
cites work: A new class of semismooth Newton-type methods for nonlinear complementarity problems
cites work: A Nonmonotone Line Search Technique for Newton’s Method
DOI: 10.1016/J.CAM.2010.01.004
description: scientific article; zbMATH DE number 5702028