Renato D. C. Monteiro
Numerical Analysis · 2003–2011
A researcher in the Science corpus: 5 papers; trusts 20 researchers and is trusted by 74 researchers here, as inferred from the citation graph.
Subfields
- Numerical Analysis — 16 citations into it; #106 of 3,586 by trust here, #185 by citations
- Optimization & Training — 12 citations into it
- Computational Theory and Mathematics — 11 citations into it; #2,867 of 12,182 by trust here, #3,924 by citations
- Computational Mechanics — 9 citations into it; #405 of 10,001 by trust here, #1,160 by citations
- Statistics and Probability — 5 citations into it; #5,361 of 12,932 by trust here, #4,253 by citations
Whom Renato D. C. Monteiro trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- S. Burer
- Yurii E. Nesterov
- Arkadi Nemirovski
- Roger Fletcher
- Peter M. Bentler
- Alfred Auslender
- Michel X. Goemans
- Reha H. Tütüncü
- Henry Wolkowicz
- Christoph Helmberg
Who trusts Renato D. C. Monteiro overall
- Guanghui Lan
- Srinadh Bhojanapalli
- B. Recht
- Mark A. Davenport
- Zhaosong Lu
- Bart Vandereycken
- Amit Singer
- Daniel Petersson
- Justin K. Romberg
- Zaiwen Wen
Papers from Renato D. C. Monteiro's perspective
Ordered by how strongly the researchers Renato D. C. Monteiro trusts endorse each paper. Same corpus, a different order for every researcher.
- Regression Shrinkage and Selection via the Lasso
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Practical Methods of Optimization: Fletcher/Practical Methods of Optimization
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Semidefinite programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization (Mathematical programming)
- The extragradient method for finding saddle points and other problems
- A lower-bound method for the dimension-free measurement of internal consistency
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework (SIAM Journal on Optimization)
- Handbook of Semidefinite Programming
Their papers
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization (2003) — 1,054 citations
- Dimension reduction and coefficient estimation in multivariate linear regression (2007) — 350 citations
- Local Minima and Convergence in Low-Rank Semidefinite Programming (2005) — 421 citations
- Primal-dual first-order methods with $${\mathcal {O}(1/\epsilon)}$$ iteration-complexity for cone programming (2011) — 83 citations
- Primal-dual first-order methods with O (1/e) iteration-complexity for cone programming. (2011) — 178 citations