Interior path following primal-dual algorithms. part I: Linear programming. - Renato D. C. Monteiro; Ilan Adler (Math. Program., 1989)

Interior path following primal-dual algorithms. part II: Convex quadratic programming. - Renato D. C. Monteiro; Ilan Adler (Math. Program., 1989)

An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence. - Renato D. C. Monteiro; Ilan Adler (Math. Oper. Res., 1990)

A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension. - Renato D. C. Monteiro; Ilan Adler; Mauricio G. C. Resende (Math. Oper. Res., 1990)

Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming. - Renato D. C. Monteiro (Math. Oper. Res., 1991)

Limiting behavior of the affine scaling continuous trajectories for linear programming problems. - Ilan Adler; Renato D. C. Monteiro (Math. Program., 1991)

A Geometric View of Parametric Linear Programming. - Ilan Adler; Renato D. C. Monteiro (Algorithmica, 1992)

On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming. - Renato D. C. Monteiro (Math. Oper. Res., 1992)

A simplified global convergence proof of the affine scaling algorithm. - Renato D. C. Monteiro; Takashi Tsuchiya; Y. Wang (Ann. Oper. Res., 1993)

Local convergence of interior-point algorithms for degenerate monotone LCP. - Renato D. C. Monteiro; Stephen J. Wright 001 (Comput. Optim. Appl., 1994)

A globally convergent primal-dual interior point algorithm for convex programming. - Renato D. C. Monteiro (Math. Program., 1994)

Superlinear primal-dual affine scaling algorithms for LCP. - Renato D. C. Monteiro; Stephen J. Wright 001 (Math. Program., 1995)

A Positive Algorithm for the Nonlinear Complementarity Problem. - Renato D. C. Monteiro; Jong-Shi Pang; Tao Wang (SIAM J. Optim., 1995)

Properties of an Interior-Point Mapping for Mixed Complementarity Problems. - Renato D. C. Monteiro; Jong-Shi Pang (Math. Oper. Res., 1996)

A general parametric analysis approach and its implication to sensitivity analysis in interior point methods. - Renato D. C. Monteiro; Sanjay Mehrotra (Math. Program., 1996)

Superlinear convergence of the affine scaling algorithm. - Takashi Tsuchiya; Renato D. C. Monteiro (Math. Program., 1996)

An interior point potential reduction method for constrained equations. - Tao Wang; Renato D. C. Monteiro; Jong-Shi Pang (Math. Program., 1996)

A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP. - Renato D. C. Monteiro; Stephen J. Wright 001 (SIAM J. Optim., 1996)

On Superlinear Convergence of Infeasible Interior-Point Algorithms for Linearly Constrained Convex Programs. - Renato D. C. Monteiro; Fangjun Zhou (Comput. Optim. Appl., 1997)

Nondegeneracy of Polyhedra and Linear Programs. - Yanhui Wang; Renato D. C. Monteiro (Comput. Optim. Appl., 1997)

A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming. - Renato D. C. Monteiro; Paulo R. Zanjácomo (Math. Program., 1997)

Primal-Dual Path-Following Algorithms for Semidefinite Programming. - Renato D. C. Monteiro (SIAM J. Optim., 1997)

On the Existence and Convergence of the Central Path for Convex Programming and Some Duality Results. - Renato D. C. Monteiro; Fangjun Zhou (Comput. Optim. Appl., 1998)

On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems. - Renato D. C. Monteiro; Jong-Shi Pang (Math. Oper. Res., 1998)

Trust region affine scaling algorithms for linearly constrained convex and concave programs. - Renato D. C. Monteiro; Yanhui Wang (Math. Program., 1998)

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 010 (Math. Program., 1998)

Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions. - Renato D. C. Monteiro (SIAM J. Optim., 1998)

Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming. - Renato D. C. Monteiro; Takashi Tsuchiya (SIAM J. Optim., 1998)

Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions. - Renato D. C. Monteiro; Takashi Tsuchiya (Math. Program., 1999)

A Potential Reduction Newton Method for Constrained Equations. - Renato D. C. Monteiro; Jong-Shi Pang (SIAM J. Optim., 1999)

Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming. - Renato D. C. Monteiro; Takashi Tsuchiya (SIAM J. Optim., 1999)

On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances. - Alfredo N. Iusem; Renato D. C. Monteiro (Math. Oper. Res., 2000)

General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems. - Renato D. C. Monteiro; Paulo R. Zanjácomo (Math. Oper. Res., 2000)

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 (Math. Program., 2000)

Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation. - Samuel Burer; Renato D. C. Monteiro; Yin Zhang 010 (Comput. Optim. Appl., 2002)

Solving a class of semidefinite programs via nonlinear programming. - Samuel Burer; Renato D. C. Monteiro; Yin Zhang 010 (Math. Program., 2002)

Maximum stable set formulations and heuristics based on continuous optimization. - Samuel Burer; Renato D. C. Monteiro; Yin Zhang 010 (Math. Program., 2002)

Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs. - Samuel Burer; Renato D. C. Monteiro; Yin Zhang 010 (SIAM J. Optim., 2002)

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. - Samuel Burer; Renato D. C. Monteiro (Math. Program., 2003)

A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs. - Samuel Burer; Renato D. C. Monteiro; Yin Zhang 010 (Math. Program., 2003)

First- and second-order methods for semidefinite programming. - Renato D. C. Monteiro (Math. Program., 2003)

A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming. - Samuel Burer; Renato D. C. Monteiro (Optim. Methods Softw., 2003)

A Variant of the Vavasis–Ye Layered-Step Interior-Point Algorithm for Linear Programming. - Renato D. C. Monteiro; Takashi Tsuchiya (SIAM J. Optim., 2003)

Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior-Point Methods. - Renato D. C. Monteiro; Jerome W. O'Neal; Takashi Tsuchiya (SIAM J. Optim., 2004)

Local Minima and Convergence in Low-Rank Semidefinite Programming. - Samuel Burer; Renato D. C. Monteiro (Math. Program., 2005)

Asymptotic behavior of the central path for a special class of degenerate SDP problems. - João Xavier da Cruz Neto; Orizon Pereira Ferreira; Renato D. C. Monteiro (Math. Program., 2005)

Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2. - Zhaosong Lu; Renato D. C. Monteiro (SIAM J. Optim., 2005)

A Note on the Local Convergence of a Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Based on the Alizadeh–Haeberly–Overton Search Direction. - Zhaosong Lu; Renato D. C. Monteiro (SIAM J. Optim., 2005)

A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm. - Renato D. C. Monteiro; Takashi Tsuchiya (SIAM J. Optim., 2005)

An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming. - Zhaosong Lu; Renato D. C. Monteiro; Jerome W. O'Neal (SIAM J. Optim., 2006)

A modified nearly exact method for solving low-rank trust region subproblem. - Zhaosong Lu; Renato D. C. Monteiro (Math. Program., 2007)

Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm. - Zhaosong Lu; Arkadi Nemirovski; Renato D. C. Monteiro (Math. Program., 2007)

Limiting behavior of the Alizadeh-Haeberly-Overton weighted paths in semidefinite programming. - Zhaosong Lu; Renato D. C. Monteiro (Optim. Methods Softw., 2007)

Dual convergence of the proximal point method with Bregman distances for linear programming. - João Xavier da Cruz Neto; Orizon Pereira Ferreira; Alfredo N. Iusem; Renato D. C. Monteiro (Optim. Methods Softw., 2007)

A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms. - Renato D. C. Monteiro; Takashi Tsuchiya (Math. Program., 2008)

An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners. - Zhaosong Lu; Renato D. C. Monteiro; Jerome W. O'Neal (Optim. Methods Softw., 2009)

A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming. - Guanghui Lan; Renato D. C. Monteiro; Takashi Tsuchiya (SIAM J. Optim., 2009)

On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean. - Renato D. C. Monteiro; Benar Fux Svaiter (SIAM J. Optim., 2010)

A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria. - Yunlong He; Renato D. C. Monteiro; Haesun Park (SDM, 2011)

Primal-dual first-order methods with O(1/e) iteration-complexity for cone programming. - Guanghui Lan; Zhaosong Lu; Renato D. C. Monteiro (Math. Program., 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. - Renato D. C. Monteiro; Benar Fux Svaiter (SIAM J. Optim., 2011)

Group Sparsity in Nonnegative Matrix Factorization. - Jingu Kim; Renato D. C. Monteiro; Haesun Park (SDM, 2012)

Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression. - Zhaosong Lu; Renato D. C. Monteiro; Ming Yuan 001 (Math. Program., 2012)

Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems. - Renato D. C. Monteiro; Benar Fux Svaiter (SIAM J. Optim., 2012)

Iteration-complexity of first-order penalty methods for convex programming. - Guanghui Lan; Renato D. C. Monteiro (Math. Program., 2013)

Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers. - Renato D. C. Monteiro; Benar Fux Svaiter (SIAM J. Optim., 2013)

An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods. - Renato D. C. Monteiro; Benar Fux Svaiter (SIAM J. Optim., 2013)

Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems. - Renato D. C. Monteiro; Camilo Ortiz; Benar Fux Svaiter (Comput. Optim. Appl., 2014)

A first-order block-decomposition method for solving two-easy-block structured semidefinite programs. - Renato D. C. Monteiro; Camilo Ortiz; Benar Fux Svaiter (Math. Program. Comput., 2014)

Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems. - Yunlong He; Renato D. C. Monteiro (SIAM J. Optim., 2015)

A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities. - Renato D. C. Monteiro; Mauricio Romero Sicre; Benar Fux Svaiter (SIAM J. Optim., 2015)

An adaptive accelerated first-order method for convex optimization. - Renato D. C. Monteiro; Camilo Ortiz; Benar Fux Svaiter (Comput. Optim. Appl., 2016)

Iteration-complexity of first-order augmented Lagrangian methods for convex programming. - Guanghui Lan; Renato D. C. Monteiro (Math. Program., 2016)

Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds. - Maicon Marques Alves; Renato D. C. Monteiro; Benar Fux Svaiter (SIAM J. Optim., 2016)

An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems. - Yunlong He; Renato D. C. Monteiro (SIAM J. Optim., 2016)

An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems. - Oliver Kolossoski; Renato D. C. Monteiro (Optim. Methods Softw., 2017)

Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework. - Max L. N. Gonçalves; Jefferson G. Melo; Renato D. C. Monteiro (SIAM J. Optim., 2017)

Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators. - Renato D. C. Monteiro; Chee-Khian Sim (Comput. Optim. Appl., 2018)

Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs. - Weiwei Kong; Jefferson G. Melo; Renato D. C. Monteiro (SIAM J. Optim., 2019)

An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems. - Weiwei Kong; Jefferson G. Melo; Renato D. C. Monteiro (Comput. Optim. Appl., 2020)

A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems. - Jiaming Liang; Renato D. C. Monteiro; Chee-Khian Sim (Comput. Optim. Appl., 2021)

Stochastic Dynamic Cutting Plane for Multistage Stochastic Convex Programs. - Vincent Guigues; Renato D. C. Monteiro (J. Optim. Theory Appl., 2021)

Inexact Cuts in Stochastic Dual Dynamic Programming Applied to Multistage Stochastic Nondifferentiable Problems. - Vincent Guigues; Renato D. C. Monteiro; Benar Fux Svaiter (SIAM J. Optim., 2021)

An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems. - Weiwei Kong; Renato D. C. Monteiro (SIAM J. Optim., 2021)

An Average Curvature Accelerated Composite Gradient Method for Nonconvex Smooth Composite Optimization Problems. - Jiaming Liang; Renato D. C. Monteiro (SIAM J. Optim., 2021)

A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes. - Jiaming Liang; Renato D. C. Monteiro (SIAM J. Optim., 2021)

Accelerated inexact composite gradient methods for nonconvex spectral optimization problems. - Weiwei Kong; Renato D. C. Monteiro (Comput. Optim. Appl., 2022)

Projection-free accelerated method for convex optimization. - Max L. N. Gonçalves; Jefferson G. Melo; Renato D. C. Monteiro (Optim. Methods Softw., 2022)

Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function. - Weiwei Kong; Jefferson G. Melo; Renato D. C. Monteiro (SIAM J. Optim., 2023)

Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints. - Weiwei Kong; Jefferson G. Melo; Renato D. C. Monteiro (Math. Oper. Res., 2023)

An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems. - Weiwei Kong; Renato D. C. Monteiro (Comput. Optim. Appl., 2023)

Average curvature FISTA for nonconvex smooth composite optimization problems. - Jiaming Liang; Renato D. C. Monteiro (Comput. Optim. Appl., 2023)

An Adaptive Superfast Inexact Proximal Augmented Lagrangian Method for Smooth Nonconvex Composite Optimization Problems. - Arnesh Sujanani; Renato D. C. Monteiro (J. Sci. Comput., 2023)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach. - Renato D. C. Monteiro; Arnesh Sujanani; Diego Cifuentes (CoRR, 2024)

A Unified Analysis of a Class of Proximal Bundle Methods for Solving Hybrid Convex Composite Optimization Problems. - Jiaming Liang; Renato D. C. Monteiro (Math. Oper. Res., 2024)

Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming. - Weiwei Kong; Renato D. C. Monteiro (SIAM J. Optim., 2024)

A Proximal Augmented Lagrangian Method for Linearly Constrained Nonconvex Composite Optimization Problems. - Jefferson G. Melo; Renato D. C. Monteiro; Hairong Wang (J. Optim. Theory Appl., 2024)

A single cut proximal bundle method for stochastic convex composite optimization. - Jiaming Liang; Vincent Guigues; Renato D. C. Monteiro (Math. Program., 2024)

Efficient Parameter-Free Restarted Accelerated Gradient Methods for Convex and Strongly Convex Optimization. - Arnesh Sujanani; Renato D. C. Monteiro (J. Optim. Theory Appl., 2025)