Interior path following primal-dual algorithms. Part I: Linear programming RDC Monteiro, I Adler Mathematical programming 44 (1-3), 27-41, 1989 | 745 | 1989 |

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization S Burer, RDC Monteiro Mathematical Programming 95 (2), 329-357, 2003 | 728 | 2003 |

Primal--Dual Path-Following Algorithms for Semidefinite Programming RDC Monteiro SIAM Journal on Optimization 7 (3), 663-678, 1997 | 446 | 1997 |

Interior path following primal-dual algorithms. Part II: Convex quadratic programming RDC Monteiro, I Adler Mathematical Programming 44 (1-3), 43-66, 1989 | 396 | 1989 |

Local minima and convergence in low-rank semidefinite programming S Burer, RDC Monteiro Mathematical Programming 103 (3), 427-444, 2005 | 349 | 2005 |

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 | 292 | 1990 |

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 | 276 | 2007 |

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 | 227* | 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 | 202 | 2000 |

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 | 199 | 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 | 183 | 2013 |

Primal-dual first-order methods with iteration-complexity for cone programming G Lan, Z Lu, RDC Monteiro Mathematical Programming 126 (1), 1-29, 2011 | 182 | 2011 |

A geometric view of parametric linear programming I Adler, RDC Monteiro Algorithmica 8 (1-6), 161-176, 1992 | 181 | 1992 |

Limiting behavior of the affine scaling continuous trajectories for linear programming problems I Adler, RDC Monteiro Mathematical Programming 50 (1-3), 29-51, 1991 | 159 | 1991 |

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 | 127 | 2010 |

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 | 105 | 1998 |

A projected gradient algorithm for solving the maxcut SDP relaxation S Burer, RDC Monteiro Optimization methods and Software 15 (3-4), 175-200, 2001 | 104* | 2001 |

First-and second-order methods for semidefinite programming RDC Monteiro Mathematical Programming 97 (1-2), 209-244, 2003 | 97 | 2003 |

Local convergence of interior-point algorithms for degenerate monotone LCP RDC Monteiro, SJ Wright Computational Optimization and Applications 3 (2), 131-155, 1994 | 89 | 1994 |

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 | 88 | 2011 |