Renato D. C. Monteiro
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Renato D. C. Monteiro has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Jefferson G. Melo
IME, Universidade Federal de Goiás, Goiânia, Brazil
10 shared publications - Weiwei Kong
Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37830 USA
7 shared publications - Arnesh Sujanani
Department of Combinatorics and Optimization University of Waterloo ON Canada
5 shared publications - Zhaosong Lu
Department of Industrial and Systems Engineering, University of Minnesota, Minneapolis, USA
5 shared publications - Benar Fux Svaiter
Instituto de Matemática Pura e Aplicada
4 shared publications - Jiaming Liang
Goergen Institute for Data Science and Artificial Intelligence (GIDS-AI) Department of Computer Science University of Rochester 14620 Rochester NY
4 shared publications
Latest Publications
- 9 June 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 206 (2) , 1-42
Efficient Parameter-Free Restarted Accelerated Gradient Methods for Convex and Strongly Convex Optimization
- 9 June 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 206 (2) , 1-42
Efficient Parameter-Free Restarted Accelerated Gradient Methods for Convex and Strongly Convex Optimization
- Open Access
A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
This paper introduces HALLaR, a new first-order method for solving large-scale semidefinite programs (SDPs) with bounded domain. HALLaR is an inexact augmented Lagrangian (AL) method where the AL subproblems are solved by a novel hybrid low-rank (HLR) method. The recipe behind HLR is based on two key ingredients: 1) an adaptive inexact proximal point method with inner acceleration; 2) Frank-Wolfe steps to escape from spurious local stationary points. In contrast to the low-rank method of Burer and Monteiro, HALLaR finds a near-optimal solution (with provable complexity bounds) of SDP instances satisfying strong duality. Computational results comparing HALLaR to state-of-the-art solvers on several large SDP instances arising from maximum stable set, phase retrieval, and matrix completion show that the former finds higher accurate solutions in substantially less CPU time than the latter ones. For example, in less than 20 minutes, HALLaR can solve a maximum stable set SDP instance with dimension pair $(n,m)\approx (10^6,10^7)$ within $10^{-5}$ relative precision.Open AccessA low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
This paper introduces HALLaR, a new first-order method for solving large-scale semidefinite programs (SDPs) with bounded domain. HALLaR is an inexact augmented Lagrangian (AL) method where the AL subproblems are solved by a novel hybrid low-rank (HLR) method. The recipe behind HLR is based on two key ingredients: 1) an adaptive inexact proximal point method with inner acceleration; 2) Frank-Wolfe steps to escape from spurious local stationary points. In contrast to the low-rank method of Burer and Monteiro, HALLaR finds a near-optimal solution (with provable complexity bounds) of SDP instances satisfying strong duality. Computational results comparing HALLaR to state-of-the-art solvers on several large SDP instances arising from maximum stable set, phase retrieval, and matrix completion show that the former finds higher accurate solutions in substantially less CPU time than the latter ones. For example, in less than 20 minutes, HALLaR can solve a maximum stable set SDP instance with dimension pair $(n,m)\approx (10^6,10^7)$ within $10^{-5}$ relative precision. - 23 September 2023
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 97 (2) , 1-41
An Adaptive Superfast Inexact Proximal Augmented Lagrangian Method for Smooth Nonconvex Composite Optimization Problems
- 23 September 2023
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 97 (2) , 1-41
An Adaptive Superfast Inexact Proximal Augmented Lagrangian Method for Smooth Nonconvex Composite Optimization Problems
- 9 May 2023
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 86 (1) , 275-302
Average curvature FISTA for nonconvex smooth composite optimization problems
- 9 May 2023
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 86 (1) , 275-302
Average curvature FISTA for nonconvex smooth composite optimization problems
- 1 May 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 48 (2) , 1066-1094
Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints
This paper proposes and analyzes a proximal augmented Lagrangian (NL-IAPIAL) method for solving constrained nonconvex composite optimization problems, where the constraints are smooth and convex wi...
- 1 May 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 48 (2) , 1066-1094
Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints
This paper proposes and analyzes a proximal augmented Lagrangian (NL-IAPIAL) method for solving constrained nonconvex composite optimization problems, where the constraints are smooth and convex wi...
- 26 April 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 202 (1) , 388-420
A Proximal Augmented Lagrangian Method for Linearly Constrained Nonconvex Composite Optimization Problems
- 26 April 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 202 (1) , 388-420
A Proximal Augmented Lagrangian Method for Linearly Constrained Nonconvex Composite Optimization Problems
- 1 March 2023
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 85 (2) , 509-545
An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems
- 1 March 2023
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 85 (2) , 509-545
An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems
- Open Access
An Accelerated Inexact Dampened Augmented Lagrangian Method for Linearly-Constrained Nonconvex Composite Optimization Problems
This paper proposes and analyzes an accelerated inexact dampened augmented Lagrangian (AIDAL) method for solving linearly-constrained nonconvex composite optimization problems. Each iteration of the AIDAL method consists of: (i) inexactly solving a dampened proximal augmented Lagrangian (AL) subproblem by calling an accelerated composite gradient (ACG) subroutine; (ii) applying a dampened and under-relaxed Lagrange multiplier update; and (iii) using a novel test to check whether the penalty parameter of the AL function should be increased. Under several mild assumptions involving the dampening factor and the under-relaxation constant, it is shown that the AIDAL method generates an approximate stationary point of the constrained problem in ${\cal O}(\varepsilon^{-5/2}\log\varepsilon^{-1})$ iterations of the ACG subroutine, for a given tolerance $\varepsilon>0$. Numerical experiments are also given to show the computational efficiency of the proposed method.Open AccessAn Accelerated Inexact Dampened Augmented Lagrangian Method for Linearly-Constrained Nonconvex Composite Optimization Problems
This paper proposes and analyzes an accelerated inexact dampened augmented Lagrangian (AIDAL) method for solving linearly-constrained nonconvex composite optimization problems. Each iteration of the AIDAL method consists of: (i) inexactly solving a dampened proximal augmented Lagrangian (AL) subproblem by calling an accelerated composite gradient (ACG) subroutine; (ii) applying a dampened and under-relaxed Lagrange multiplier update; and (iii) using a novel test to check whether the penalty parameter of the AL function should be increased. Under several mild assumptions involving the dampening factor and the under-relaxation constant, it is shown that the AIDAL method generates an approximate stationary point of the constrained problem in ${\cal O}(\varepsilon^{-5/2}\log\varepsilon^{-1})$ iterations of the ACG subroutine, for a given tolerance $\varepsilon>0$. Numerical experiments are also given to show the computational efficiency of the proposed method. - Open Access
Average Curvature FISTA for Nonconvex Smooth Composite Optimization Problems
A previous authors' paper introduces an accelerated composite gradient (ACG) variant, namely AC-ACG, for solving nonconvex smooth composite optimization (N-SCO) problems. In contrast to other ACG variants, AC-ACG estimates the local upper curvature of the N-SCO problem by using the average of the observed upper-Lipschitz curvatures obtained during the previous iterations, and uses this estimation and two composite resolvent evaluations to compute the next iterate. This paper presents an alternative FISTA-type ACG variant, namely AC-FISTA, which has the following additional features: i) it performs an average of one composite resolvent evaluation per iteration; and ii) it estimates the local upper curvature by using the average of the previously observed upper (instead of upper-Lipschitz) curvatures. These two properties acting together yield a practical AC-FISTA variant which substantially outperforms earlier ACG variants, including the AC-ACG variants discussed in the aforementioned authors' paper.
Open AccessAverage Curvature FISTA for Nonconvex Smooth Composite Optimization Problems
A previous authors' paper introduces an accelerated composite gradient (ACG) variant, namely AC-ACG, for solving nonconvex smooth composite optimization (N-SCO) problems. In contrast to other ACG variants, AC-ACG estimates the local upper curvature of the N-SCO problem by using the average of the observed upper-Lipschitz curvatures obtained during the previous iterations, and uses this estimation and two composite resolvent evaluations to compute the next iterate. This paper presents an alternative FISTA-type ACG variant, namely AC-FISTA, which has the following additional features: i) it performs an average of one composite resolvent evaluation per iteration; and ii) it estimates the local upper curvature by using the average of the previously observed upper (instead of upper-Lipschitz) curvatures. These two properties acting together yield a practical AC-FISTA variant which substantially outperforms earlier ACG variants, including the AC-ACG variants discussed in the aforementioned authors' paper.