Renato D. C. Monteiro

6.8k total citations · 1 hit paper
107 papers, 4.2k citations indexed

About

Renato D. C. Monteiro is a scholar working on Numerical Analysis, Computational Theory and Mathematics and Computational Mechanics. According to data from OpenAlex, Renato D. C. Monteiro has authored 107 papers receiving a total of 4.2k indexed citations (citations by other indexed papers that have themselves been cited), including 94 papers in Numerical Analysis, 85 papers in Computational Theory and Mathematics and 60 papers in Computational Mechanics. Recurrent topics in Renato D. C. Monteiro's work include Advanced Optimization Algorithms Research (94 papers), Sparse and Compressive Sensing Techniques (60 papers) and Optimization and Variational Analysis (48 papers). Renato D. C. Monteiro is often cited by papers focused on Advanced Optimization Algorithms Research (94 papers), Sparse and Compressive Sensing Techniques (60 papers) and Optimization and Variational Analysis (48 papers). Renato D. C. Monteiro collaborates with scholars based in United States, Brazil and Japan. Renato D. C. Monteiro's co-authors include Ilan Adler, Samuel Burer, B. F. Svaiter, Zhaosong Lu, Takashi Tsuchiya, Guanghui Lan, Yin Zhang, Ming Yuan, Jong‐Shi Pang and Ali Ekici and has published in prestigious journals such as Journal of the Royal Statistical Society Series B (Statistical Methodology), Mathematical Programming and Annals of Operations Research.

In The Last Decade

Renato D. C. Monteiro

105 papers receiving 3.8k citations

Hit Papers

1 papers align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

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

2003 448 citations Samuel Burer, Renato D. C. Monteiro Mathematical Programming profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Renato D. C. Monteiro United States	32	2.8k	2.5k	1.6k	739	428	107	4.2k
Jean‐Baptiste Hiriart‐Urruty France	26	2.5k 0.9×	3.0k 1.2×	1.2k 0.7×	460 0.6×	734 1.7×	79	5.3k
B. F. Svaiter Brazil	38	3.5k 1.2×	4.0k 1.6×	1.8k 1.1×	544 0.7×	370 0.9×	118	5.8k
Adrian S. Lewis United States	40	2.3k 0.8×	2.7k 1.1×	1.9k 1.2×	747 1.0×	899 2.1×	132	6.0k
Ya-xiang Yuan China	28	2.1k 0.8×	1.5k 0.6×	1.2k 0.7×	597 0.8×	447 1.0×	89	3.8k
Defeng Sun Singapore	43	3.5k 1.2×	3.0k 1.2×	2.6k 1.6×	380 0.5×	531 1.2×	125	5.7k
Michael L. Overton United States	36	2.1k 0.8×	2.4k 1.0×	1.0k 0.6×	350 0.5×	1.1k 2.6×	111	4.9k
J. Frédéric Bonnans France	26	2.1k 0.7×	2.6k 1.1×	1.0k 0.6×	303 0.4×	995 2.3×	119	4.9k
Henry Wolkowicz Canada	35	2.5k 0.9×	2.8k 1.1×	1.2k 0.7×	469 0.6×	636 1.5×	126	5.1k
Katya Scheinberg United States	26	1.1k 0.4×	1.1k 0.5×	1.0k 0.6×	1.3k 1.8×	443 1.0×	55	3.5k
Hongchao Zhang United States	22	2.1k 0.7×	1.3k 0.5×	1.6k 1.0×	581 0.8×	276 0.6×	61	3.5k

Countries citing papers authored by Renato D. C. Monteiro

Since Specialization

Citations

This map shows the geographic impact of Renato D. C. Monteiro's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Renato D. C. Monteiro with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Renato D. C. Monteiro more than expected).

Fields of papers citing papers by Renato D. C. Monteiro

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Renato D. C. Monteiro. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Renato D. C. Monteiro. The network helps show where Renato D. C. Monteiro may publish in the future.

Co-authorship network of co-authors of Renato D. C. Monteiro

This figure shows the co-authorship network connecting the top 25 collaborators of Renato D. C. Monteiro. A scholar is included among the top collaborators of Renato D. C. Monteiro based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Renato D. C. Monteiro. Renato D. C. Monteiro is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Monteiro, Renato D. C., et al.. (2024). Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming. SIAM Journal on Optimization. 34(1). 201–224. 2 indexed citations

Melo, Jefferson G., et al.. (2023). Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function. SIAM Journal on Optimization. 33(1). 181–210. 5 indexed citations

Guigues, Vincent, et al.. (2023). A single cut proximal bundle method for stochastic convex composite optimization. Mathematical Programming. 208(1-2). 173–208.

Monteiro, Renato D. C., et al.. (2023). An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems. Computational Optimization and Applications. 85(2). 509–545. 1 indexed citations

Monteiro, Renato D. C., et al.. (2022). Accelerated inexact composite gradient methods for nonconvex spectral optimization problems. Computational Optimization and Applications. 82(3). 673–715. 2 indexed citations

Melo, Jefferson G., et al.. (2022). Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints. Mathematics of Operations Research. 48(2). 1066–1094. 6 indexed citations

Gonçalves, Max L. N., Jefferson G. Melo, & Renato D. C. Monteiro. (2020). Projection-free accelerated method for convex optimization. Optimization methods & software. 37(1). 214–240. 4 indexed citations

He, Yunlong & Renato D. C. Monteiro. (2016). An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems. SIAM Journal on Optimization. 26(1). 29–56. 39 indexed citations

Monteiro, Renato D. C. & B. F. Svaiter. (2011). 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. SIAM Journal on Optimization. 21(4). 1688–1720. 66 indexed citations

10.

Lu, Zhaosong, Arkadi Nemirovski, & Renato D. C. Monteiro. (2006). Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm. Mathematical Programming. 109(2-3). 211–237. 19 indexed citations

11.

Monteiro, Renato D. C. & Takashi Tsuchiya. (2005). A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm. SIAM Journal on Optimization. 15(2). 319–347. 12 indexed citations

12.

Monteiro, Renato D. C., et al.. (2004). A New Conjugate Gradient Algorithm Incorporating Adaptive Ellipsoid Preconditioning. 2 indexed citations

13.

Burer, Samuel, Renato D. C. Monteiro, & Yin Zhang. (2002). Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs. SIAM Journal on Optimization. 12(2). 503–521. 132 indexed citations

14.

Burer, Samuel, Renato D. C. Monteiro, & Yin Zhang. (2002). Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation. Computational Optimization and Applications. 22(1). 49–79. 12 indexed citations

15.

Iusem, Alfredo N. & Renato D. C. Monteiro. (2000). On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances. Mathematics of Operations Research. 25(4). 606–624. 6 indexed citations

16.

Monteiro, Renato D. C. & Jong‐Shi Pang. (1996). Properties of an Interior-Point Mapping for Mixed Complementarity Problems. Mathematics of Operations Research. 21(3). 629–654. 26 indexed citations

17.

Adler, Ilan & Renato D. C. Monteiro. (1992). A geometric view of parametric linear programming. Algorithmica. 8(1-6). 161–176. 72 indexed citations

18.

Monteiro, Renato D. C. & Steve Wright. (1992). A globally and superlinearly convergent potential reduction interior point method for convex programming. OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information). 6 indexed citations

19.

Monteiro, Renato D. C.. (1991). Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming. Mathematics of Operations Research. 16(4). 842–858. 19 indexed citations

20.

Monteiro, Renato D. C. & Ilan Adler. (1989). Interior path following primal-dual algorithms. part I: Linear programming. Mathematical Programming. 44(1-3). 27–41. 323 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact