Renato D. C. Monteiro

发表

Dual convergence of the proximal point method with Bregman distances for linear programming

Alfredo N. Iusem, João X. da Cruz Neto, Orizon Pereira Ferreira, 2007, Optim. Methods Softw..

Complexity of the relaxed Peaceman–Rachford splitting method for the sum of two maximal strongly monotone operators

Renato D. C. Monteiro, Chee-Khian Sim, 2018, Comput. Optim. Appl..

A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming

Renato D. C. Monteiro, Samuel Burer, R. Monteiro, 2003, Optim. Methods Softw..

Local convergence of interior-point algorithms for degenerate monotone LCP

Stephen J. Wright, Renato D. C. Monteiro, R. Monteiro, 1994, Comput. Optim. Appl..

Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions

Takashi Tsuchiya, Renato D. C. Monteiro, 1999, Math. Program..

Properties of an Interior-Point Mapping for Mixed Complementarity Problems

Renato D. C. Monteiro, Jong-Shi Pang, R. Monteiro, 1996, Math. Oper. Res..

Group Sparsity in Nonnegative Matrix Factorization

Renato D. C. Monteiro, Haesun Park, Jingu Kim, 2012, SDM.

Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression

Renato D. C. Monteiro, Ming Yuan, Zhaosong Lu, 2009, Mathematical Programming.

On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming

Renato D. C. Monteiro, R. Monteiro, 1992, Math. Oper. Res..

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

Renato D. C. Monteiro, Ilan Adler, R. C. Monteiro, 1991, Math. Program..

Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems

Renato D. C. Monteiro, Benar Fux Svaiter, R. Monteiro, 2012, SIAM J. Optim..

A simplified global convergence proof of the affine scaling algorithm

Takashi Tsuchiya, Y. Wang, Renato D. C. Monteiro, 1993, Ann. Oper. Res..

General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems

Renato D. C. Monteiro, Paulo R. Zanjácomo, R. C. Monteiro, 2000, Math. Oper. Res..

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

Renato D. C. Monteiro, Guanghui Lan, Zhaosong Lu, 2011, Math. Program..

Theory and algorithms for convex programming

Renato D. C. Monteiro, 2013 .

A Potential Reduction Newton Method for Constrained Equations

Renato D. C. Monteiro, Jong-Shi Pang, R. Monteiro, 1999, SIAM J. Optim..

Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems

Renato D. C. Monteiro, Benar Fux Svaiter, Camilo Ortiz, 2014, Comput. Optim. Appl..

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

Renato D. C. Monteiro, Samuel Burer, R. Monteiro, 2003, Math. Program..

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

Renato D. C. Monteiro, Benar Fux Svaiter, R. Monteiro, 2010, SIAM J. Optim..

Iteration-complexity of first-order penalty methods for convex programming

Renato D. C. Monteiro, Guanghui Lan, Guanghui Lan, 2013, Math. Program..

First- and second-order methods for semidefinite programming

Renato D. C. Monteiro, R. Monteiro, 2003, Math. Program..

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

Takashi Tsuchiya, Renato D. C. Monteiro, R. Monteiro, 2008, Math. Program..

Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior-Point Methods

Takashi Tsuchiya, Renato D. C. Monteiro, Jerome W. O'Neal, 2004, SIAM J. Optim..

Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation

Yin Zhang, Renato D. C. Monteiro, Samuel Burer, 2002, Comput. Optim. Appl..

Trust region affine scaling algorithms for linearly constrained convex and concave programs

Yanhui Wang, Renato D. C. Monteiro, R. Monteiro, 1998, Math. Program..

Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems

Renato D. C. Monteiro, Yunlong He, R. Monteiro, 2015, SIAM J. Optim..

A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm

Takashi Tsuchiya, Renato D. C. Monteiro, R. Monteiro, 2005, SIAM J. Optim..

On the Existence and Convergence of the Central Path for Convex Programming and Some Duality Results

Renato D. C. Monteiro, Fangjun Zhou, 1998, Comput. Optim. Appl..

Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming

Takashi Tsuchiya, Renato D. C. Monteiro, R. Monteiro, 1998, SIAM J. Optim..

A Positive Algorithm for the Nonlinear Complementarity Problem

Tao Wang, Renato D. C. Monteiro, Jong-Shi Pang, 1995, SIAM J. Optim..

Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming

Renato D. C. Monteiro, Zhaosong Lu, Zhaosong Lu, 2007, Optim. Methods Softw..

Superlinear convergence of the affine scaling algorithm

Takashi Tsuchiya, Renato D. C. Monteiro, R. Monteiro, 1996, Math. Program..

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

Renato D. C. Monteiro, Benar Fux Svaiter, R. Monteiro, 2013, SIAM J. Optim..

An adaptive accelerated first-order method for convex optimization

Renato D. C. Monteiro, Benar Fux Svaiter, Camilo Ortiz, 2016, Comput. Optim. Appl..

A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities

Renato D. C. Monteiro, Benar Fux Svaiter, Mauricio R. Sicre, 2015, SIAM J. Optim..

A modified nearly exact method for solving low-rank trust region subproblem

Renato D. C. Monteiro, Zhaosong Lu, 2007, Math. Program..

Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm

Renato D. C. Monteiro, Zhaosong Lu, Arkadi Nemirovski, 2007, Math. Program..

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, R. Monteiro, 2011, SIAM J. Optim..

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

Yin Zhang, Renato D. C. Monteiro, R. Monteiro, 1998, Math. Program..

An algorithm for sparse PCA based on a new sparsity control criterion

Renato D. C. Monteiro, Haesun Park, Yunlong He, 2011 .

Solving Semidefinite Programs via Nonlinear Programming, Part II: Interior Point Methods for a Subclass of SDPs

Renato D. C. Monteiro, Yin Zhang, Sam Burer, 1999 .

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

Renato D. C. Monteiro, Zhaosong Lu, 2005, SIAM J. Optim..

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

Renato D. C. Monteiro, Guanghui Lan, Guanghui Lan, 2015, Mathematical Programming.

Collaborative research: theory and implementation of semidefinite programming and its applications to combinatorial optimization

Renato D. C. Monteiro, R. Monteiro, 2009 .

Nondegeneracy of Polyhedra and Linear Programs

Yanhui Wang, Renato D. C. Monteiro, R. Monteiro, 1997, Comput. Optim. Appl..

A general parametric analysis approach and its implication to sensitivity analysis in interior point methods

Renato D. C. Monteiro, Sanjay Mehrotra, R. Monteiro, 1996, Math. Program..

Primal-Dual Path-Following Algorithms for Semidefinite Programming

Renato D. C. Monteiro, R. Monteiro, 1997, SIAM J. Optim..

Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds

Renato D. C. Monteiro, Benar Fux Svaiter, Maicon Marques Alves, 2016, SIAM J. Optim..

Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework

Renato D. C. Monteiro, Jefferson G. Melo, Max L. N. Gonçalves, 2016, SIAM J. Optim..

Digital Object Identifier (DOI) 10.1007/s10107-004-0564-1

Renato D. C. Monteiro, Samuel Burer, R. Monteiro, 2004 .

An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners

Renato D. C. Monteiro, Zhaosong Lu, Jerome W. O'Neal, 2009, Optim. Methods Softw..

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

Renato D. C. Monteiro, Ilan Adler, R. C. Monteiro, 1989, Math. Program..

A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming

Renato D. C. Monteiro, Paulo R. Zanjácomo, R. Monteiro, 1997, Math. Program..

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

Renato D. C. Monteiro, Ilan Adler, R. C. Monteiro, 1989, Math. Program..

An interior point potential reduction method for constrained equations

Tao Wang, Renato D. C. Monteiro, Jong-Shi Pang, 1996, Math. Program..

An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex–concave saddle-point problems

Renato D. C. Monteiro, O. Kolossoski, R. Monteiro, 2017, Optim. Methods Softw..

Digital Object Identifier (DOI) 10.1007/s101070100279

Yin Zhang, Renato D. C. Monteiro, Samuel Burer, 2000 .

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

Yin Zhang, Renato D. C. Monteiro, Samuel Burer, 2002, SIAM J. Optim..

On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances

Alfredo N. Iusem, Renato D. C. Monteiro, 2000, Math. Oper. Res..

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

Renato D. C. Monteiro, R. Monteiro, 1998, SIAM J. Optim..

A globally convergent primal—dual interior point algorithm for convex programming

Renato D. C. Monteiro, 1994, Math. Program..

On Superlinear Convergence of Infeasible Interior-Point Algorithms for Linearly Constrained Convex Programs

Renato D. C. Monteiro, Fangjun Zhou, 1997, Comput. Optim. Appl..

An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems

Renato D. C. Monteiro, Yunlong He, R. Monteiro, 2016, SIAM J. Optim..

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, R. C. Monteiro, 1990, Math. Oper. Res..

Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers

Renato D. C. Monteiro, Benar Fux Svaiter, R. Monteiro, 2013, SIAM J. Optim..

Asymptotic behavior of the central path for a special class of degenerate SDP problems

João X. da Cruz Neto, Orizon Pereira Ferreira, Renato D. C. Monteiro, 2005, Math. Program..

A geometric view of parametric linear programming

Renato D. C. Monteiro, Ilan Adler, R. C. Monteiro, 1992, Algorithmica.

Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2

Renato D. C. Monteiro, Zhaosong Lu, Zhaosong Lu, 2005, SIAM J. Optim..

Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming

Renato D. C. Monteiro, R. C. Monteiro, R. Monteiro, 1991, Math. Oper. Res..

A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming

Takashi Tsuchiya, Renato D. C. Monteiro, R. Monteiro, 2002, SIAM J. Optim..

A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs

Yin Zhang, Renato D. C. Monteiro, Samuel Burer, 2003, Math. Program..

A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming

Takashi Tsuchiya, Renato D. C. Monteiro, Guanghui Lan, 2008, SIAM J. Optim..

A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria

Renato D. C. Monteiro, Haesun Park, Yunlong He, 2011, SDM.

Path-Following Methods

Michael J. Todd, Renato D. C. Monteiro, R. Monteiro, 2000 .

A first-order block-decomposition method for solving two-easy-block structured semidefinite programs

Renato D. C. Monteiro, Benar Fux Svaiter, Camilo Ortiz, 2014, Math. Program. Comput..

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

Takashi Tsuchiya, Renato D. C. Monteiro, R. Monteiro, 2000, Math. Program..

On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems

Renato D. C. Monteiro, Jong-Shi Pang, 1998, Math. Oper. Res..

A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension

Mauricio G. C. Resende, Renato D. C. Monteiro, Ilan Adler, 1990, Math. Oper. Res..

Maximum stable set formulations and heuristics based on continuous optimization

Yin Zhang, Renato D. C. Monteiro, Samuel Burer, 2002, Math. Program..

Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming

Takashi Tsuchiya, Renato D. C. Monteiro, R. Monteiro, 1999, SIAM J. Optim..

A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP

Stephen J. Wright, Renato D. C. Monteiro, R. Monteiro, 1996, SIAM J. Optim..

An Efficient Algorithm for Solving the MAXCUT SDP Relaxation

Renato D. C. Monteiro, Samuel Burer, R. Monteiro, 1998 .

Superlinear primal-dual affine scaling algorithms for LCP

Stephen J. Wright, Renato D. C. Monteiro, R. Monteiro, 1995, Math. Program..

An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming

Renato D. C. Monteiro, Zhaosong Lu, Jerome W. O'Neal, 2006, SIAM J. Optim..

Average Curvature FISTA for Nonconvex Smooth Composite Optimization Problems

Renato D. C. Monteiro, Jiaming Liang, 2021 .

On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM

Renato D. C. Monteiro, Jefferson G. Melo, Max L. N. Gonçalves, 2020, Optimization.

An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex QP

Renato D. C. Monteiro, Zhaosong Lu, Jerome W. O'Neal, 2004 .

Accelerating block-decomposition first-order methods for solving generalized saddle-point and Nash equilibrium problems

Renato D. C. Monteiro, Yunlong He, R. Monteiro, 2014 .