Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Markus Hodapp
Markus Böhm
Claudia Calabrese
Hao Mao
Peter Malec
Giovanni Venturelli
Chen Ma
Howard Ratner
Radu Timofte
Kuanrui Yin
Home
/
Author
/
J. STOER
Author Info
Open Visualization
Name
Affiliation
Papers
J. STOER
Johannes Gutenberg Univ., Mainz, Germany
13
Collaborators
Citations
PageRank
8
155
51.88
Referers
Referees
References
123
63
71
Search Limit
100
123
Publications (13 rows)
Collaborators (8 rows)
Referers (100 rows)
Referees (63 rows)
Title
Citations
PageRank
Year
On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
13
0.66
2009
Minimization of convex functions on the convex hull of a point set
2
0.39
2005
Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
12
0.67
2004
High Order Long-Step Methods for Solving Linear Complementarity Problems
11
0.75
2001
On the analyticity properties of infeasible-interior-point paths for monotone linear complementarity problems
17
1.33
1999
Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
27
1.78
1998
High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
31
1.80
1998
On the complexity of following the central path of linear programs by linear extrapolation II
21
3.03
1991
Solution of Large Linear Systems of Equations by Conjugate Gradient Type Methods
12
38.65
1982
On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
4
0.74
1975
On the Convergence Behaviour of Some Minimization Algorithms
0
0.34
1974
A Direct Method for Chebyshev Approximation by Rational Functions
5
1.40
1964
Algorithm 105: Newton Maehly
0
0.34
1962
1