default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosef Stoer
Person information
- affiliation: Julius Maximilian University of Würzburg, Department of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j11]Florian A. Potra, Josef Stoer:
On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP. SIAM J. Optim. 20(3): 1333-1363 (2009)- 2005
- [j10]Nikolai D. Botkin
, Josef Stoer:
Minimization of convex functions on the convex hull of a point set. Math. Methods Oper. Res. 62(2): 167-185 (2005) - 2004
- [j9]Martin Preiß, Josef Stoer:
Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems. Math. Program. 99(3): 499-520 (2004) - 2001
- [j8]Josef Stoer:
High Order Long-Step Methods for Solving Linear Complementarity Problems. Ann. Oper. Res. 103(1-4): 149-159 (2001)
1990 – 1999
- 1999
- [j7]Josef Stoer, Martin Wechs:
On the analyticity properties of infeasible-interior-point paths for monotone linear complementarity problems. Numerische Mathematik 81(4): 631-645 (1999) - 1998
- [j6]Josef Stoer, Martin Wechs, Shinji Mizuno:
High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems. Math. Oper. Res. 23(4): 832-862 (1998) - [j5]Josef Stoer, Martin Wechs:
Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity. Math. Program. 83: 407-423 (1998) - 1991
- [j4]György Sonnevend, Josef Stoer, Gongyun Zhao:
On the complexity of following the central path of linear programs by linear extrapolation II. Math. Program. 52: 527-553 (1991)
1980 – 1989
- 1982
- [c2]Josef Stoer:
Solution of Large Linear Systems of Equations by Conjugate Gradient Type Methods. ISMP 1982: 540-565 - 1981
- [e1]Wilfried Brauer, Per Brinch Hansen, David Gries, C. Moler, Gerhard Seegmüller, Josef Stoer, Niklaus Wirth:
The Programming Language Ada Reference Manual, Proposed Standard Document, United States Department of Defense. Lecture Notes in Computer Science 106, Springer 1981, ISBN 3-540-10693-6
1970 – 1979
- 1975
- [j3]Josef Stoer:
On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class. Math. Program. 9(1): 313-335 (1975) - 1974
- [c1]Josef Stoer:
On the Convergence Behaviour of Some Minimization Algorithms. IFIP Congress 1974: 476-482
1960 – 1969
- 1964
- [j2]Josef Stoer:
A Direct Method for Chebyshev Approximation by Rational Functions. J. ACM 11(1): 59-69 (1964) - 1962
- [j1]Friedrich L. Bauer, Josef Stoer:
Algorithm 105: Newton Maehly. Commun. ACM 5(7): 387-388 (1962)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
