- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j38 |      | Guanghui Lan, Renato D. C. Monteiro: Iteration-complexity of first-order penalty methods for convex programming. Math. Program. 138(1-2): 115-139 (2013) |
| j37 | | Renato D. C. Monteiro, Benar Fux Svaiter: Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers. SIAM Journal on Optimization 23(1): 475-507 (2013) |
| 2012 | ||
| j36 | | Zhaosong Lu, Renato D. C. Monteiro, Ming Yuan: Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression. Math. Program. 131(1-2): 163-194 (2012) |
| j35 | | Renato D. C. Monteiro, Benar Fux Svaiter: Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems. SIAM Journal on Optimization 22(3): 914-935 (2012) |
| 2011 | ||
| j34 | | Guanghui Lan, Zhaosong Lu, Renato D. C. Monteiro: Primal-dual first-order methods with O(1/e) iteration-complexity for cone programming. Math. Program. 126(1): 1-29 (2011) |
| j33 | | Renato D. C. Monteiro, Benar Fux Svaiter: 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 (2011) |
| 2010 | ||
| j32 | | Renato D. C. Monteiro, Benar Fux Svaiter: On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean. SIAM Journal on Optimization 20(6): 2755-2787 (2010) |
| 2009 | ||
| j31 | | Guanghui Lan, Renato D. C. Monteiro, Takashi Tsuchiya: A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming. SIAM Journal on Optimization 19(4): 1918-1946 (2009) |
| 2008 | ||
| j30 | | Renato D. C. Monteiro, Takashi Tsuchiya: 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. 115(1): 105-149 (2008) |
| 2007 | ||
| j29 | | Zhaosong Lu, Arkadi Nemirovski, Renato D. C. Monteiro: Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm. Math. Program. 109(2-3): 211-237 (2007) |
| j28 | | Zhaosong Lu, Renato D. C. Monteiro: A modified nearly exact method for solving low-rank trust region subproblem. Math. Program. 109(2-3): 385-411 (2007) |
| 2006 | ||
| j27 | | Zhaosong Lu, Renato D. C. Monteiro, Jerome W. O'Neal: An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming. SIAM Journal on Optimization 17(1): 287-310 (2006) |
| 2005 | ||
| j26 | | Samuel Burer, Renato D. C. Monteiro: Local Minima and Convergence in Low-Rank Semidefinite Programming. Math. Program. 103(3): 427-444 (2005) |
| j25 | | João X. da Cruz Neto, Orizon P. Ferreira, Renato D. C. Monteiro: Asymptotic behavior of the central path for a special class of degenerate SDP problems. Math. Program. 103(3): 487-514 (2005) |
| j24 | | Renato D. C. Monteiro, Takashi Tsuchiya: A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm. SIAM Journal on Optimization 15(2): 319-347 (2005) |
| j23 | | Zhaosong Lu, Renato D. C. Monteiro: Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2. SIAM Journal on Optimization 15(2): 348-374 (2005) |
| j22 | | Zhaosong Lu, Renato D. C. Monteiro: 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 Journal on Optimization 15(4): 1147-1154 (2005) |
| 2004 | ||
| j21 | | Renato D. C. Monteiro, Jerome W. O'Neal, Takashi Tsuchiya: Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior-Point Methods. SIAM Journal on Optimization 15(1): 96-100 (2004) |
| 2003 | ||
| j20 | | Samuel Burer, Renato D. C. Monteiro: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. 95(2): 329-357 (2003) |
| j19 | | Samuel Burer, Renato D. C. Monteiro, Yin Zhang: A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs. Math. Program. 95(2): 359-379 (2003) |
| j18 | | Renato D. C. Monteiro: First- and second-order methods for semidefinite programming. Math. Program. 97(1-2): 209-244 (2003) |
| j17 | | Renato D. C. Monteiro, Takashi Tsuchiya: A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming. SIAM Journal on Optimization 13(4): 1054-1079 (2003) |
| 2002 | ||
| j16 | | Samuel Burer, Renato D. C. Monteiro, Yin Zhang: Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation. Comp. Opt. and Appl. 22(1): 49-79 (2002) |
| j15 | | Samuel Burer, Renato D. C. Monteiro, Yin Zhang: Solving a class of semidefinite programs via nonlinear programming. Math. Program. 93(1): 97-122 (2002) |
| j14 | | Samuel Burer, Renato D. C. Monteiro, Yin Zhang: Maximum stable set formulations and heuristics based on continuous optimization. Math. Program. 94(1): 137-166 (2002) |
| j13 | | Samuel Burer, Renato D. C. Monteiro, Yin Zhang: Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs. SIAM Journal on Optimization 12(2): 503-521 (2002) |
| 2000 | ||
| j12 | | Renato D. C. Monteiro, Paulo R. Zanjácomo: General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems. Math. Oper. Res. 25(3): 381-399 (2000) |
| j11 | | Alfredo N. Iusem, Renato D. C. Monteiro: On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances. Math. Oper. Res. 25(4): 606-624 (2000) |
| 1998 | ||
| j10 | | Renato D. C. Monteiro, Yanhui Wang: Trust region affine scaling algorithms for linearly constrained convex and concave programs. Math. Program. 80: 283-313 (1998) |
| j9 | | Renato D. C. Monteiro, Yin Zhang: A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming. Math. Program. 81: 281-299 (1998) |
| 1997 | ||
| j8 | | Renato D. C. Monteiro, Paulo R. Zanjácomo: A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming. Math. Program. 77: 393-396 (1997) |
| 1996 | ||
| j7 | | Renato D. C. Monteiro, Sanjay Mehrotra: A general parametric analysis approach and its implication to sensitivity analysis in interior point methods. Math. Program. 72: 65-82 (1996) |
| j6 | | Tao Wang, Renato D. C. Monteiro, Jong-Shi Pang: An interior point potential reduction method for constrained equations. Math. Program. 74: 159-195 (1996) |
| j5 | | Takashi Tsuchiya, Renato D. C. Monteiro: Superlinear convergence of the affine scaling algorithm. Math. Program. 75: 77-110 (1996) |
| 1995 | ||
| j4 | | Renato D. C. Monteiro, Stephen J. Wright: Superlinear primal-dual affine scaling algorithms for LCP. Math. Program. 69: 311-333 (1995) |
| 1994 | ||
| j3 | | Renato D. C. Monteiro: A globally convergent primal-dual interior point algorithm for convex programming. Math. Program. 64: 123-147 (1994) |
| 1992 | ||
| j2 | | Ilan Adler, Renato D. C. Monteiro: A Geometric View of Parametric Linear Programming. Algorithmica 8(2): 161-176 (1992) |
| 1991 | ||
| j1 | | Ilan Adler, Renato D. C. Monteiro: Limiting behavior of the affine scaling continuous trajectories for linear programming problems. Math. Program. 50: 29-51 (1991) |
Colors in the list of coauthors
Last update Mon May 20 05:22:12 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page