Algorithm 105: Newton Maehly. - Friedrich L. Bauer; Josef Stoer (Commun. ACM, 1962)

A Direct Method for Chebyshev Approximation by Rational Functions. - Josef Stoer (J. ACM, 1964)

On the Convergence Behaviour of Some Minimization Algorithms. - Josef Stoer (IFIP Congress, 1974)

On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class. - Josef Stoer (Math. Program., 1975)

Solution of Large Linear Systems of Equations by Conjugate Gradient Type Methods. - Josef Stoer (ISMP, 1982)

On the complexity of following the central path of linear programs by linear extrapolation II. - György Sonnevend; Josef Stoer; Gongyun Zhao (Math. Program., 1991)

High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems. - Josef Stoer; Martin Wechs; Shinji Mizuno (Math. Oper. Res., 1998)

Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity. - Josef Stoer; Martin Wechs (Math. Program., 1998)

On the analyticity properties of infeasible-interior-point paths for monotone linear complementarity problems. - Josef Stoer; Martin Wechs (Numerische Mathematik, 1999)

High Order Long-Step Methods for Solving Linear Complementarity Problems. - Josef Stoer (Ann. Oper. Res., 2001)

Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems. - Martin Preiß; Josef Stoer (Math. Program., 2004)

Minimization of convex functions on the convex hull of a point set. - Nikolai D. Botkin; Josef Stoer (Math. Methods Oper. Res., 2005)

On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP. - Florian A. Potra; Josef Stoer (SIAM J. Optim., 2009)