- Digital Object Identifier (DOI) 10.1007/s101070100279 Math. Program., Ser. A 93: 97122 (2002)
- A Globally and Superlinearly Convergent Potential Reduction Interior Point Method for Convex
- A Simplified Global Convergence Proof of the Affine Scaling Algorithm 3
- Solving Semidefinite Programs via Nonlinear Programming Part II: Interior Point Methods for a Subclass of SDPs
- A Projected Gradient Algorithm for Solving the Maxcut SDP Relaxation
- Local Convergence of InteriorPoint Algorithms for Degenerate Monotone LCP
- Projective Scaling Continuous Trajectories 1 Convergence and Boundary Behavior of the Projective
- On Two InteriorPoint Mappings for Nonlinear Semidefinite Complementarity Problems
- On Superlinear Convergence of InfeasibleInteriorPoint Algorithms for Linearly Constrained Convex Programs \Lambda
- GLOBAL CONVERGENCE OF THE AFFINE SCALING ALGORITHM FOR CONVEX QUADRATIC PROGRAMMING
- Copyright information to be inserted by the Publishers IMPLEMENTATION OF PRIMALDUAL
- Convex Optimization Methods for Dimension Reduction and Coecient Estimation in Multivariate Linear Regression
- MathematicalProgramming64 (1994) 123-147 A globally convergent primal-dual interior point
- On the Existence and Convergence of the Central Path for Convex Programming and Some Duality Results
- Mathematical Programming 81 (1998)281 299 A unified analysis for a class of long-step primal-dual
- MathematicalProgramming78 (1997) 393-396 A note on the existence of the
- A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semide nite Programming
- A VARIANT OF THE VAVASISYE LAYERED-STEP INTERIOR-POINT ALGORITHM FOR LINEAR PROGRAMMING
- ERROR BOUNDS AND LIMITING BEHAVIOR OF WEIGHTED PATHS ASSOCIATED WITH THE SDP MAP X1/2
- Digital Object Identifier (DOI) 10.1007/s10107-004-0555-2 Math. Program., Ser. A 103, 487514 (2005)
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- Iteration-complexity of block-decomposition algorithms and the alternating minimization augmented Lagrangian method
- Convergence rate of inexact proximal point methods with relative error criteria for convex optimization
- Mathematical Programming44 (1989)27-41 27 North-Holland
- Mathematical Programming 72 (1996) 65-82 A general parametric analysis approach
- Mathematical Programming 75 (1996) 77-110 Superlinear convergence of the affine scaling
- Math. Program., Ser. B 95: 359379 (2003) Digital Object Identifier (DOI) 10.1007/s10107-002-0353-7
- SIAM J. OPTIM. c 2004 Society for Industrial and Applied Mathematics Vol. 15, No. 2, pp. 319347
- Digital Object Identifier (DOI) 10.1007/s10107-003-0451-1 Math. Program., Ser. B 97: 209244 (2003)
- Optimization Methods and Software Vol. 22, No. 2, April 2007, 339360
- Iteration-complexity of first-order penalty methods for convex programming
- MathematicalProgramming80 (1998) 283-313 Trust region affine scaling algorithms for linearly
- POLYNOMIAL CONVERGENCE OF A NEW FAMILY OF PRIMAL-DUAL ALGORITHMS
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. OPTIM. c 2009 Society for Industrial and Applied Mathematics
- General InteriorPoint Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems \Lambda
- Interior-Point Algorithms for Semide nite Programming Based on a Nonlinear Formulation
- A General Framework for Establishing Polynomial Convergence of LongStep Methods for Semidefinite Programming \Lambda
- Digital Object Identifier (DOI) 10.1007/s10107-002-0356-4 Math. Program., Ser. A 94: 137166 (2002)
- Convergence Analysis of a Long-Step Primal-Dual Infeasible Interior-Point LP Algorithm
- RANK-TWO RELAXATION HEURISTICS FOR MAX-CUT AND OTHER BINARY QUADRATIC PROGRAMS
- A New Conjugate Gradient Algorithm Incorporating Adaptive Ellipsoid Preconditioning
- Iterationcomplexity of blockdecomposition algorithms and the alternating minimization augmented Lagrangian method
- Mathematical Programming 69 (1995) 311-333 Superlinear primal-dual affine scaling algorithms
- A Positive Algorithm for the Nonlinear Complementarity Problem Renato D.C. Monteiro 3
- PRIMAL{DUAL PATH-FOLLOWING ALGORITHMS FOR SEMIDEFINITE PROGRAMMING
- A POTENTIAL REDUCTION NEWTON METHOD FOR CONSTRAINED EQUATIONS
- A SUPERLINEAR INFEASIBLEINTERIORPOINT AFFINE SCALING ALGORITHM FOR LCP
- Nondegeneracy of Polyhedra and Linear Programs \Lambda Yanhui Wang y and Renato D.C. Monteiro y
- Math. Program., Ser. A (2008) 115:105149 DOI 10.1007/s10107-007-0141-5
- Mathematical Programming44(1989)43-66 43 North-Holland
- UNIFORM BOUNDEDNESS OF A PRECONDITIONED NORMAL MATRIX USED IN INTERIOR-POINT METHODS
- Nondegeneracy of Polyhedra and Linear Programs* Yanhui Wang yand Renato D.C. Monteiroy
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- Copyright information to be inserted by the Publishers IMPLEMENTATION OF PRIMAL-DUAL
- Convergence rate of inexact proximal point methods with relative error criteria for convex optimization
- Iteration-complexity of first-order penalty methods for convex programming *
- SIAMVJ.oOPTIM.l. 8, No. 3, pp. 797-812, AugOc1998uSocietysfortIndustrial1and9Ap* *plied9Mathematics8 009
- Convergence Analysis of a Long-Step Primal-Dual Infeasible Interior-Point LP Algorithm
- Complexity of variants of Tseng's modified FB splitting and Korpelevich's methods for generalized variational inequalities with
- Complexity of variants of Tseng's modified F-B splitting and Korpelevich's methods for generalized variational inequalities with
- POLYNOMIAL CONVERGENCE OF PRIMAL-DUAL ALGORITHMS FOR SEMIDEFINITE PROGRAMMING BASED ON THE
- A PolynomialTime PrimalDual Affine Scaling Algorithm for Linear and Convex Quadratic
- Iterationcomplexity of firstorder penalty methods for convex programming #
- An efficient algorithm for rank-1 sparse PCA Georgia Institute of Technology
- SIAMVJ.oOPTIM.l. 12, No. 2, pp. 503-521 Oc2001 Society for Industrial and Ap* *plied Mathematics
- SIAMVJ.oOPTIM.l. 8, No. 1, pp. 26-58, FebruOc1998aSocietyrforyIndustrial1and9Ap* *plied9Mathematics8 002
- A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming*
- A SUPERLINEAR INFEASIBLE-INTERIOR-POINT AFFINE SCALING ALGORITHM FOR LCP
- On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems
- A Globally and Superlinearly Convergent Potential Reduction Interior Point Method for Convex
- On Superlinear Convergence of Infeasible-Interior-Point Algorithms for Linearly Constrained Convex Programs *
- A Projected Gradient Algorithm for Solving the Maxcut SDP Relaxation*
- SIAMVJ.oOPTIM.l. 7, No. 3, pp. 663-678, AugOc1997uSocietysfortIndustrial1and9Ap* *plied9Mathematics7 005
- Polynomial Convergence of Primal-Dual Algorithms for the Second-Order Cone Program Based on the MZ-Family of Directions
- Iteration-complexity of rst-order augmented Lagrangian methods for convex programming
- On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances
- Properties of an InteriorPoint Mapping for Mixed Complementarity Problems
- A POTENTIAL REDUCTION NEWTON METHOD FOR CONSTRAINED EQUATIONS
- Math. Program. 84: 3953 (1999) / DOI 10.1007/s10107980021a Springer-Verlag 1999 Renato D.C. Monteiro Takashi Tsuchiya
- Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity
- Convergence rate of inexact proximal point methods with relative error criteria for convex optimization
- Convex Optimization Methods for Dimension Reduction and Coefficient Estimation in Multivariate Linear Regression
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic
- General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems*
- A New Conjugate Gradient Algorithm Incorporating Adaptive Ellipsoid Preconditioning
- Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming *
- A Positive Algorithm for the Nonlinear Complementarity Problem Renato D.C. Monteiro* Jong-Shi Pangyand Tao Wang
- Solving Semidefinite Programs via Nonlinear Programming Part I: Transformations and Derivatives*
- Iteration-complexity of block-decomposition algorithms and the alternating minimization augmented Lagrangian method
- PREPRINT MCS-P357-0493, MATHEMATICS AND COMPUTER SCIENCE DIVISION, ARGONNE NATI* *ONAL LABORATORY
- Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation*
- Solving Semidefinite Programs via Nonlinear Programming Part II: Interior Point Methods for a Subclass of SDPs
- Complexity of variants of Tseng's modified F-B splitting and Korpelevich's methods for generalized variational inequalities with
- On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances
- Mathematical Programming manuscript No. * ||(will be inserted by the editor) *
- A Simplified Global Convergence Proof of the Affine Scaling Algorithm
- Properties of an Interior-Point Mapping for Mixed Complementarity Problems
- Math. Program., Ser. B 95: 329357 (2003) Digital Object Identifier (DOI) 10.1007/s10107-002-0352-8
- Digital Object Identifier (DOI) 10.1007/s101070000137 Math. Program., Ser. A 88: 6183 (2000)
- Digital Object Identifier (DOI) 10.1007/s10107-004-0564-1 Math. Program., Ser. A 103, 427444 (2005)
- Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems
- Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems
- Implementation of a block-decomposition algorithm for solving large-scale conic semideonite programming problems
- An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and its Implications to Second-Order Methods
- Implementation of a block-decomposition algorithm for solving large-scale conic semide nite programming problems
- An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and its Implications to SecondOrder Methods
- IterationComplexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems
- An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and its Implications to Second-Order Methods
