Skip to main navigation
Skip to search
Skip to main content
Experts@Minnesota Home
Home
Profiles
Research units
University Assets
Projects and Grants
Research output
Datasets
Press/Media
Activities
Fellowships, Honors, and Prizes
Impacts
Search by expertise, name or affiliation
An O(√nL) iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP
Wenbao Ai
,
Shuzhong Zhang
Industrial and Systems Engineering
Research output
:
Contribution to journal
›
Article
›
peer-review
109
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'An O(√nL) iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Central Path
50%
Complementary Solution
50%
Dual-path
100%
Duality Gap
50%
Interior Solutions
50%
Interior-point Algorithm
50%
Iteration Bound
50%
Large-update
100%
Monotone
100%
Monotone Linear Complementarity Problem
50%
Newton Direction
50%
Newton's Method
50%
Path Following
100%
Positive Part
50%
Predictive Algorithm
50%
Primal-dual
100%
Search Direction
50%
Two-directional
50%
Wide Neighborhood
100%
Mathematics
Classical Approach
50%
Complementarity Problem
50%
Duality Gap
50%
Interior Point
50%
Negative Part
50%
Newton Direction
50%
Newton's Method
50%
Positive Part
50%
Predictor-Corrector
50%
Search Direction
50%
Step Size
100%