Osman Güler


  1. Foundations of Optimization, Springer Verlag, 2010, Graduate Texts in Mathematics, Vol. 258.


  1. ``The symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies,'' (with Filiz Gürtuna), Optimization Methods and Software, 2011.

  2. ``Duality in quasi-Newton methods and new variational characterizations of the DFP and BFGS updates,'' (with Filiz Gürtuna and Olena Shevchenko), Optimization Methods and Software 24 (2009) 45-62.
  3. ``Convergence rate estimates for the gradient differential inclusion,'' Optimization Methods and Software 20 (2005) 729-735.

  4. ``Self-scaled barrier functions on symmetric cones and their classification,''(with Raphael A. Hauser), Foundations of Computational Mathematics 2 (2002) 121-143.

  5. ``Hyperbolic polynomials and convex analysis,'' (with Heinz H. Bauschke, Adrian S. Lewis, and Hristo S. Sendov), Canadian Journal of Mathematics 53 (2001) 470-488.

  6. ``Characterization of the barrier parameter of homogeneous convex cones,'' (with Levent Tuncel). Mathematical Programming 81 (1998) 55-76.

  7. ``Hyperbolic polynomials and interior point methods for convex programming,'' Mathematics of Operations Research 22 (1997) 350-377.

  8. ``On the self-concordance of the universal barrier function,'' SIAM Journal on Optimization 7 (1997) 295-303.

  9. ``Barrier functions in interior point methods,'' Mathematics of Operations Research 21 (1996) 860-885.

  10. ``A survey of the implications of the behavior of the central path for the duality theory of linear programming,'' (with Cornelis Roos, Tamas Terlaky, and Jean-Philip Vial). Management Science 41 (1995) 1922-1934.

  11. ``Generalized linear complementarity problems.'' Mathematics of Operations Research 20 (1995) 441-448.

  12. ``Approximation of solutions of linear inequalities,'' (with Alan J. Hoffman and Uriel Rothblum). SIAM Journal on Matrix Analysis and Applications 16 (1995) 688-696.

  13. ``Ergodic convergence in proximal point algorithms with Bregman functions,'' in Advances in Optimization and Approximation, D. Z. Du and J. Sun (Eds.), pp. 155-165, (Kluwer Academic Publishers, Boston, Dordrecht, 1994).

  14. ``Limiting behavior of weighted central paths in linear programming,'' Mathematical Programming, (Series A) 65 (1994) 347-363.

  15. ``Complexity of smooth convex programming and its applications,'' in Complexity of Numerical Optimization, P. M. Pardalos (Ed.), pp. 180-202, (World Scientific, Singapore, New Jersey, 1993).

  16. ``Degeneracy in interior point algorithms for linear programming: a survey,'' (with Dick den Hertog, Cornelis Roos, Tamas Terlaky, and Takashi Tsuchiya) Annals of Operations Research 46 (1993) 107-138.

  17. ``A quadratically convergent $O(sqrt{n}L)$-iteration algorithm for linear programming,'' (with Yinyu Ye, Richard A. Tapia, and Yin Zhang) Mathematical Programming (Series A) 59 (1993) 151-162.

  18. ``Convergence behavior of interior point algorithms,'' (with Yinyu Ye) Mathematical Programming (Series A) 60 (1993) 215-228.

  19. ``Existence of interior points and interior paths in nonlinear monotone complementarity problems,'' Mathematics of Operations Research 18 (1993) 128-147.

  20. ``New proximal point algorithms for convex minimization,'' SIAM Journal on Optimization 2 (1992) 649-664.

  21. ``Augmented Lagrangian algorithms for linear programming,'' Journal of Optimization Theory and Applications 75 (1992) 445-470.

  22. ``On the convergence of the proximal point algorithm for convex minimization,'' SIAM Journal on Control and Optimization 29 (1991) 403-419.