World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
43
Citations
9347
World Ranking
1675
National Ranking
723

Engineering and Technology

D-Index
43
Citations
9390
World Ranking
6048
National Ranking
1681

Overview

Renato D. C. Monteiro is affiliated with the Georgia Institute of Technology in the United States. Their research primarily focuses on areas intersecting computer science, engineering, and mathematics, contributing extensively to computational mechanics, numerical analysis, artificial intelligence, and the mathematical foundations of optimization algorithms.

Their recent scientific publications cover advancements in optimization methods, especially in nonconvex and composite optimization problems. Key papers include:

  • An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems, 2021, SIAM Journal on Optimization
  • An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems, 2020, Computational Optimization and Applications
  • Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints, 2022, Mathematics of Operations Research
  • Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems, 2020, arXiv (Cornell University)
  • An Average Curvature Accelerated Composite Gradient Method for Nonconvex Smooth Composite Optimization Problems, 2021, SIAM Journal on Optimization

Monteiro's work frequently appears in journals and repositories well regarded in optimization and applied mathematics, with significant contributions in the following venues:

  • arXiv (Cornell University)
  • SIAM Journal on Optimization
  • Computational Optimization and Applications
  • Journal of Optimization Theory and Applications
  • Mathematics of Operations Research

The scientist collaborates with several researchers across optimization and numerical methods. Frequent co-authors include:

  • Jiaming Liang
  • Weiwei Kong
  • Jefferson G. Melo
  • Vincent Guigues
  • Arnesh Sujanani

Their research topics focus heavily on optimization and computational techniques, covering areas such as:

  • Sparse and Compressive Sensing Techniques
  • Advanced Optimization Algorithms Research
  • Stochastic Gradient Optimization Techniques
  • Optimization and Variational Analysis
  • Risk and Portfolio Optimization
  • Numerical methods in inverse problems
  • Topology Optimization in Engineering

Monteiro's interdisciplinary approach bridges theoretical foundations and applied computational methods, grounded in areas like computational mechanics and numerical analysis. This positions their work at the interface of algorithmic development and practical optimization challenges.

Best Publications

  • A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

    Samuel Burer;Renato D.C. Monteiro

  • Interior path following primal-dual algorithms. Part I: Linear programming

    Renato D.C. Monteiro;Ilan Adler

  • Local Minima and Convergence in Low-Rank Semidefinite Programming

    Samuel Burer;Renato D. C. Monteiro

  • Primal--Dual Path-Following Algorithms for Semidefinite Programming

    Renato D. C. Monteiro

  • Interior path following primal-dual algorithms. Part II: Convex quadratic programming

    Renato D.C. Monteiro;Ilan Adler

  • Dimension reduction and coefficient estimation in multivariate linear regression

    Ming Yuan;Ali Ekici;Zhaosong Lu;Renato Monteiro

  • A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension

    R. C. Monteiro;I. Adler;M. G.C. Resende

  • Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs

    Samuel Burer;Renato D. C. Monteiro;Yin Zhang

  • ITERATION-COMPLEXITY OF BLOCK-DECOMPOSITION ALGORITHMS AND THE ALTERNATING DIRECTION METHOD OF MULTIPLIERS ∗

    Renato D. C. Monteiro;Benar Fux Svaiter

  • Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions

    Renato D.C. Monteiro;Takashi Tsuchiya

  • Primal-dual first-order methods with $${\mathcal {O}(1/psilon)}$$iteration-complexity for cone programming

    Guanghui Lan;Zhaosong Lu;Renato D. C. Monteiro

  • A geometric view of parametric linear programming

    Ilan Adler;Renato D. Monteiro

  • A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming

    Renato D.C. Monteiro;Yin Zhang

  • On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean

    Renato D. C. Monteiro;B. F. Svaiter

  • Limiting behavior of the affine scaling continuous trajectories for linear programming problems

    Ilan Adler;Renato D. C. Monteiro

  • Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems

    Renato D. C. Monteiro;B. F. Svaiter

  • Interior path following primal-dual algorithms

    Renato Duarte Carneiro Monteiro;Ilan Adler

  • An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods

    Renato D. C. Monteiro;Benar Fux Svaiter

  • Iteration-complexity of first-order augmented Lagrangian methods for convex programming

    Guanghui Lan;Renato D. Monteiro

  • Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions

    Renato D. C. Monteiro

Frequent Co-Authors

Benar Fux Svaiter
Benar Fux Svaiter Instituto Nacional de Matemática Pura e Aplicada
Yin Zhang
Yin Zhang Chinese University of Hong Kong, Shenzhen
Guanghui Lan
Guanghui Lan Georgia Institute of Technology
Jong-Shi Pang
Jong-Shi Pang University of Southern California
Samuel Burer
Samuel Burer University of Iowa
Stephen J. Wright
Stephen J. Wright University of Wisconsin–Madison
Ming Yuan
Ming Yuan Columbia University
Haesun Park
Haesun Park Georgia Institute of Technology
Alfredo N. Iusem
Alfredo N. Iusem Fundação Getulio Vargas
Arkadi Nemirovski
Arkadi Nemirovski Georgia Institute of Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing an online degree in Mathematics opens doors to diverse career opportunities in finance, technology, and data analysis. Many students also consider complementing their mathematical expertise with business-oriented qualifications. For professionals seeking to accelerate their education, exploring the fastest online mba programs can provide a swift pathway to leadership roles.

Cost-efficiency is another critical factor when choosing a degree. Similar to how one might evaluate an ms in digital marketing degree cost tuition fees, prospective students should compare tuition and duration to maximize their investment.

For those balancing career and study, a one year mba program offers an intensive yet manageable option to gain new skills quickly. Additionally, many programs provide flexibility through credit transfers; understanding can you transfer credits into an mba program can help students save time and tuition by applying previous coursework toward their degree.

Ultimately, combining a strong mathematical foundation with strategic online degrees can create a competitive edge in today’s evolving job market.

Best Scientists Citing Renato D. C. Monteiro

Trending Scientists