Feasible descent algorithms for mixed complementarity problems
type: Item
instance of: scholarly article
title: Feasible descent algorithms for mixed complementarity problems
zbMATH Open document ID: 0946.90094
author: Michael C. Ferris
author: Christian Kanzow
author: Todd S. Munson
published in: Mathematical Programming. Series A. Series B
publication date: 2000-03-21T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 49M37
zbMATH DE Number: 1419749
zbMATH Keywords: mixed complementarity problems
zbMATH Keywords: global convergence
zbMATH Keywords: superlinear convergence
zbMATH Keywords: feasible descent methods
describes a project that uses: MCPLIB
describes a project that uses: PATH Solver
describes a project that uses: QPCOMP
describes a project that uses: GAMS
describes a project that uses: GQTPAR
MaRDI profile type: Publication
full work available at URL: s101070050101
OpenAlex ID: W2119279696
DOI: 10.1007/S101070050101
description: scientific article; zbMATH DE number 1419749