The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Renato D. C. Monteiro: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ilan Adler, Renato D. C. Monteiro
    A Geometric View of Parametric Linear Programming. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:2, pp:161-176 [Journal]
  2. Alfredo N. Iusem, Renato D. C. Monteiro
    On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2000, v:25, n:4, pp:606-624 [Journal]
  3. Renato D. C. Monteiro, Paulo R. Zanjácomo
    General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2000, v:25, n:3, pp:381-399 [Journal]
  4. Ilan Adler, Renato D. C. Monteiro
    Limiting behavior of the affine scaling continuous trajectories for linear programming problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:29-51 [Journal]
  5. Samuel Burer, Renato D. C. Monteiro
    A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2003, v:95, n:2, pp:329-357 [Journal]
  6. Samuel Burer, Renato D. C. Monteiro
    Local Minima and Convergence in Low-Rank Semidefinite Programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:103, n:3, pp:427-444 [Journal]
  7. Samuel Burer, Renato D. C. Monteiro, Yin Zhang
    A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2003, v:95, n:2, pp:359-379 [Journal]
  8. Renato D. C. Monteiro
    A globally convergent primal-dual interior point algorithm for convex programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:64, n:, pp:123-147 [Journal]
  9. Renato D. C. Monteiro, Sanjay Mehrotra
    A general parametric analysis approach and its implication to sensitivity analysis in interior point methods. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:72, n:, pp:65-82 [Journal]
  10. Renato D. C. Monteiro, Stephen J. Wright
    Superlinear primal-dual affine scaling algorithms for LCP. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:69, n:, pp:311-333 [Journal]
  11. Renato D. C. Monteiro, Yanhui Wang
    Trust region affine scaling algorithms for linearly constrained convex and concave programs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:80, n:, pp:283-313 [Journal]
  12. Renato D. C. Monteiro, Paulo R. Zanjácomo
    A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:77, n:, pp:393-396 [Journal]
  13. Renato D. C. Monteiro, Yin Zhang
    A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:81, n:, pp:281-299 [Journal]
  14. João X. da Cruz Neto, Orizon P. Ferreira, Renato D. C. Monteiro
    Asymptotic behavior of the central path for a special class of degenerate SDP problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:103, n:3, pp:487-514 [Journal]
  15. T. Tsuchiya, Renato D. C. Monteiro
    Superlinear convergence of the affine scaling algorithm. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:75, n:, pp:77-110 [Journal]
  16. Tao Wang, Renato D. C. Monteiro, Jong-Shi Pang
    An interior point potential reduction method for constrained equations. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:74, n:, pp:159-195 [Journal]
  17. Zhaosong Lu, Arkadi Nemirovski, Renato D. C. Monteiro
    Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:109, n:2-3, pp:211-237 [Journal]
  18. Zhaosong Lu, Renato D. C. Monteiro
    A modified nearly exact method for solving low-rank trust region subproblem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:109, n:2-3, pp:385-411 [Journal]

Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002