The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Renato D. C. Monteiro" ( http://dblp.L3S.de/Authors/Renato_D._C._Monteiro )

  Author page on DBLP  Author page in RDF  Community of Renato D. C. Monteiro in ASPL-2

Publication years (Num. hits)
1991-2002 (15) 2003-2009 (15) 2010-2012 (4)
Publication types (Num. hits)
article(34)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 16 occurrences of 14 keywords

Results
Found 34 publication records. Showing 34 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Zhaosong Lu, Renato D. C. Monteiro, Ming Yuan Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression. Search on Bibsonomy Math. Program. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Renato 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. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Guanghui Lan, Zhaosong Lu, Renato D. C. Monteiro Primal-dual first-order methods with O(1/e) iteration-complexity for cone programming. Search on Bibsonomy Math. Program. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Renato D. C. Monteiro, Benar Fux Svaiter On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Guanghui Lan, Renato D. C. Monteiro, Takashi Tsuchiya A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Renato 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. Search on Bibsonomy Math. Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification 65K05, 68Q25, 90C51, 90C05, 90C60
1Zhaosong Lu, Arkadi Nemirovski, Renato D. C. Monteiro Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm. Search on Bibsonomy Math. Program. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 90C22, 90C25, 90C51, 65K10
1Zhaosong Lu, Renato D. C. Monteiro A modified nearly exact method for solving low-rank trust region subproblem. Search on Bibsonomy Math. Program. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 90C06, 90C30, 65K05
1Zhaosong Lu, Renato D. C. Monteiro, Jerome W. O'Neal An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Zhaosong Lu, Renato D. C. Monteiro Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Renato D. C. Monteiro, Takashi Tsuchiya A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Zhaosong 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. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Samuel Burer, Renato D. C. Monteiro Local Minima and Convergence in Low-Rank Semidefinite Programming. Search on Bibsonomy Math. Program. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Low-rank matrices, Vector programming, Combinatorial optimization, Semidefinite programming, Nonlinear programming, Numerical experiments, Augmented Lagrangian
1Joã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. Search on Bibsonomy Math. Program. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Limiting behavior, Convex quadratic programming, Convex quadratically constrained programming, Semidefinite programming, Central path
1Renato D. C. Monteiro, Jerome W. O'Neal, Takashi Tsuchiya Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior-Point Methods. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Renato D. C. Monteiro, Takashi Tsuchiya A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Renato D. C. Monteiro First- and second-order methods for semidefinite programming. Search on Bibsonomy Math. Program. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Samuel Burer, Renato D. C. Monteiro A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Search on Bibsonomy Math. Program. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Samuel Burer, Renato D. C. Monteiro, Yin Zhang A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs. Search on Bibsonomy Math. Program. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Samuel Burer, Renato D. C. Monteiro, Yin Zhang Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Samuel Burer, Renato D. C. Monteiro, Yin Zhang Solving a class of semidefinite programs via nonlinear programming. Search on Bibsonomy Math. Program. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Samuel Burer, Renato D. C. Monteiro, Yin Zhang Maximum stable set formulations and heuristics based on continuous optimization. Search on Bibsonomy Math. Program. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Alfredo N. Iusem, Renato D. C. Monteiro On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Renato D. C. Monteiro, Paulo R. Zanjácomo General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Renato D. C. Monteiro, Yin Zhang A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming. Search on Bibsonomy Math. Program. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Renato D. C. Monteiro, Yanhui Wang Trust region affine scaling algorithms for linearly constrained convex and concave programs. Search on Bibsonomy Math. Program. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Renato D. C. Monteiro, Paulo R. Zanjácomo A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming. Search on Bibsonomy Math. Program. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Takashi Tsuchiya, Renato D. C. Monteiro Superlinear convergence of the affine scaling algorithm. Search on Bibsonomy Math. Program. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Tao Wang, Renato D. C. Monteiro, Jong-Shi Pang An interior point potential reduction method for constrained equations. Search on Bibsonomy Math. Program. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Renato D. C. Monteiro, Sanjay Mehrotra A general parametric analysis approach and its implication to sensitivity analysis in interior point methods. Search on Bibsonomy Math. Program. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Renato D. C. Monteiro, Stephen J. Wright Superlinear primal-dual affine scaling algorithms for LCP. Search on Bibsonomy Math. Program. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Renato D. C. Monteiro A globally convergent primal-dual interior point algorithm for convex programming. Search on Bibsonomy Math. Program. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Ilan Adler, Renato D. C. Monteiro A Geometric View of Parametric Linear Programming. Search on Bibsonomy Algorithmica The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Ilan Adler, Renato D. C. Monteiro Limiting behavior of the affine scaling continuous trajectories for linear programming problems. Search on Bibsonomy Math. Program. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #34 of 34 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.