A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization S Burer, RDC Monteiro Mathematical programming 95 (2), 329-357, 2003 | 1117 | 2003 |
Interior path following primal-dual algorithms. Part I: Linear programming RDC Monteiro, I Adler Mathematical programming 44 (1), 27-41, 1989 | 872 | 1989 |
Local minima and convergence in low-rank semidefinite programming S Burer, RDC Monteiro Mathematical programming 103 (3), 427-444, 2005 | 543 | 2005 |
Primal--dual path-following algorithms for semidefinite programming RDC Monteiro SIAM Journal on Optimization 7 (3), 663-678, 1997 | 486 | 1997 |
Interior path following primal-dual algorithms. Part II: Convex quadratic programming RDC Monteiro, I Adler Mathematical Programming 44 (1), 43-66, 1989 | 471 | 1989 |
Dimension reduction and coefficient estimation in multivariate linear regression M Yuan, A Ekici, Z Lu, R Monteiro Journal of the Royal Statistical Society Series B: Statistical Methodology …, 2007 | 394 | 2007 |
A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension RDC Monteiro, I Adler, MGC Resende Mathematics of Operations Research 15 (2), 191-214, 1990 | 327 | 1990 |
Rank-two relaxation heuristics for max-cut and other binary quadratic programs S Burer, RDC Monteiro, Y Zhang SIAM Journal on Optimization 12 (2), 503-521, 2002 | 290 | 2002 |
Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers RDC Monteiro, BF Svaiter SIAM Journal on Optimization 23 (1), 475-507, 2013 | 267 | 2013 |
A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming RDC Monteiro, Y Zhang Mathematical Programming 81 (3), 281-299, 1998 | 250 | 1998 |
Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions RDC Monteiro, T Tsuchiya Mathematical programming 88 (1), 61-83, 2000 | 237 | 2000 |
On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean RDC Monteiro, BF Svaiter SIAM Journal on Optimization 20 (6), 2755-2787, 2010 | 233 | 2010 |
A geometric view of parametric linear programming I Adler, RDC Monteiro Algorithmica 8, 161-176, 1992 | 226 | 1992 |
Primal-dual first-order methods with iteration-complexity for cone programming G Lan, Z Lu, RDC Monteiro Mathematical Programming 126 (1), 1-29, 2011 | 219 | 2011 |
An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods RDC Monteiro, BF Svaiter SIAM Journal on Optimization 23 (2), 1092-1125, 2013 | 209 | 2013 |
Green infrastructure planning principles: An integrated literature review R Monteiro, JC Ferreira, P Antunes Land 9 (12), 525, 2020 | 194 | 2020 |
Limiting behavior of the affine scaling continuous trajectories for linear programming problems I Adler, RDC Monteiro Mathematical Programming 50, 29-51, 1991 | 180 | 1991 |
Iteration-complexity of first-order augmented Lagrangian methods for convex programming G Lan, RDC Monteiro Mathematical Programming 155 (1), 511-547, 2016 | 144 | 2016 |
Complexity of variants of Tseng's modified FB splitting and Korpelevich's methods for hemivariational inequalities with applications to saddle-point and convex optimization … RDC Monteiro, BF Svaiter SIAM Journal on Optimization 21 (4), 1688-1720, 2011 | 138 | 2011 |
Polynomial convergence of primal-dual algorithms for semidefinite programming based on the Monteiro and Zhang family of directions RDC Monteiro SIAM Journal on Optimization 8 (3), 797-812, 1998 | 127 | 1998 |