Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Feasible descent algorithms for mixed complementarity problems
Home
Publications
Feasible descent algorithms for mixed complementarity problems
Feasible descent algorithms for mixed complementarity problems
Authors:
MF
Michael C. Ferris
Michael C. Ferris
CK
Christian Kanzow
Christian Kanzow
TM
Todd S. Munson
Todd S. Munson
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 December 1999
journal article
Published by
Springer Nature
in
Mathematical Programming
Vol. 86
(3)
,
475-497
DOI:
10.1007/s101070050101
Abstract
No abstract available
Keywords
KEY WORDS: MIXED COMPLEMENTARITY PROBLEMS GLOBAL CONVERGENCE SUPERLINEAR CONVERGENCE FEASIBLE DESCENT METHODS
Cited
Cited by 63 articles
Scroll to top