Renato D. C. Monteiro
According to our database1,
Renato D. C. Monteiro
authored at least 95 papers
between 1989 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming.
SIAM J. Optim., March, 2024
A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach.
CoRR, 2024
2023
An Adaptive Superfast Inexact Proximal Augmented Lagrangian Method for Smooth Nonconvex Composite Optimization Problems.
J. Sci. Comput., November, 2023
Comput. Optim. Appl., September, 2023
An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems.
Comput. Optim. Appl., June, 2023
Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints.
Math. Oper. Res., May, 2023
Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function.
SIAM J. Optim., March, 2023
2022
Optim. Methods Softw., 2022
Accelerated inexact composite gradient methods for nonconvex spectral optimization problems.
Comput. Optim. Appl., 2022
2021
A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes.
SIAM J. Optim., 2021
An Average Curvature Accelerated Composite Gradient Method for Nonconvex Smooth Composite Optimization Problems.
SIAM J. Optim., 2021
An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems.
SIAM J. Optim., 2021
Inexact Cuts in Stochastic Dual Dynamic Programming Applied to Multistage Stochastic Nondifferentiable Problems.
SIAM J. Optim., 2021
J. Optim. Theory Appl., 2021
A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems.
Comput. Optim. Appl., 2021
2020
An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems.
Comput. Optim. Appl., 2020
2019
Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs.
SIAM J. Optim., 2019
2018
Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators.
Comput. Optim. Appl., 2018
2017
Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework.
SIAM J. Optim., 2017
An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems.
Optim. Methods Softw., 2017
2016
An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems.
SIAM J. Optim., 2016
Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds.
SIAM J. Optim., 2016
Iteration-complexity of first-order augmented Lagrangian methods for convex programming.
Math. Program., 2016
Comput. Optim. Appl., 2016
2015
A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities.
SIAM J. Optim., 2015
Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems.
SIAM J. Optim., 2015
2014
A first-order block-decomposition method for solving two-easy-block structured semidefinite programs.
Math. Program. Comput., 2014
Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems.
Comput. Optim. Appl., 2014
2013
An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods.
SIAM J. Optim., 2013
Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers.
SIAM J. Optim., 2013
Math. Program., 2013
2012
Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems.
SIAM J. Optim., 2012
Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression.
Math. Program., 2012
Proceedings of the Twelfth SIAM International Conference on Data Mining, 2012
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 J. Optim., 2011
Primal-dual first-order methods with <i>O</i>(1/e) iteration-complexity for cone programming.
Math. Program., 2011
Proceedings of the Eleventh SIAM International Conference on Data Mining, 2011
2010
On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean.
SIAM J. Optim., 2010
2009
SIAM J. Optim., 2009
An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners.
Optim. Methods Softw., 2009
2008
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.
Math. Program., 2008
2007
Dual convergence of the proximal point method with Bregman distances for linear programming.
Optim. Methods Softw., 2007
Limiting behavior of the Alizadeh-Haeberly-Overton weighted paths in semidefinite programming.
Optim. Methods Softw., 2007
Math. Program., 2007
Math. Program., 2007
2006
An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming.
SIAM J. Optim., 2006
2005
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.
SIAM J. Optim., 2005
Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2.
SIAM J. Optim., 2005
Asymptotic behavior of the central path for a special class of degenerate SDP problems.
Math. Program., 2005
Math. Program., 2005
2004
Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior-Point Methods.
SIAM J. Optim., 2004
2003
A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming.
SIAM J. Optim., 2003
A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming.
Optim. Methods Softw., 2003
A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs.
Math. Program., 2003
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization.
Math. Program., 2003
2002
SIAM J. Optim., 2002
Math. Program., 2002
Math. Program., 2002
Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation.
Comput. Optim. Appl., 2002
2000
Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions.
Math. Program., 2000
General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems.
Math. Oper. Res., 2000
Math. Oper. Res., 2000
1999
Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming.
SIAM J. Optim., 1999
Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions.
Math. Program., 1999
1998
SIAM J. Optim., 1998
Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions.
SIAM J. Optim., 1998
A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming.
Math. Program., 1998
Trust region affine scaling algorithms for linearly constrained convex and concave programs.
Math. Program., 1998
Math. Oper. Res., 1998
On the Existence and Convergence of the Central Path for Convex Programming and Some Duality Results.
Comput. Optim. Appl., 1998
1997
SIAM J. Optim., 1997
A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming.
Math. Program., 1997
On Superlinear Convergence of Infeasible Interior-Point Algorithms for Linearly Constrained Convex Programs.
Comput. Optim. Appl., 1997
1996
SIAM J. Optim., 1996
Math. Program., 1996
A general parametric analysis approach and its implication to sensitivity analysis in interior point methods.
Math. Program., 1996
Math. Oper. Res., 1996
1995
1994
Math. Program., 1994
Comput. Optim. Appl., 1994
1993
Ann. Oper. Res., 1993
1992
On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming.
Math. Oper. Res., 1992
1991
Limiting behavior of the affine scaling continuous trajectories for linear programming problems.
Math. Program., 1991
Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming.
Math. Oper. Res., 1991
1990
A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension.
Math. Oper. Res., 1990
An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence.
Math. Oper. Res., 1990
1989
Interior path following primal-dual algorithms. part II: Convex quadratic programming.
Math. Program., 1989
Math. Program., 1989