Publications
These reports can be downloaded in either compressed dvi,
compressed postscript or pdf format by clicking on the
appropriate tag.

1) linear.pdf. (OK)
 R.D.C. Monteiro, I. Adler, "An O ( n^3 L )
primaldual interior point algorithm for linear programming".
Revised version: "Interior path following primaldual algorithms.
Part I: Linear programming," Mathematical Programming
44 (1989) 2741.

2) quad.pdf. (OK)
 R.D.C. Monteiro, I. Adler,
"An O ( n^3 L ) interior point
algorithm for convex quadratic programming".
Revised version: "Interior path following primaldual algorithms.
Part II: Convex quadratic programming,"
Mathematical Programming 44 (1989) 4366.

3) nonli.pdf. (OK)
 R.D.C. Monteiro, I. Adler,
"An extension of Karmarkar type
algorithm to a class of convex separable programming problems
with global linear rate of convergence,"
Mathematics of Operations Research 15 (1990) 408422.

4)
pd.pdf. (OK)
 R.D.C. Monteiro, I. Adler and M.G.C. Resende,
"A polynomialtime primaldual affine scaling algorithm for linear
and convex quadratic programming and its power series extension,"
Mathematics of Operations Research 15 (1990) 191214.

5) waffine.pdf. (OK)
 I. Adler and R.D.C. Monteiro,
"Limiting behavior of the affine scaling continuous trajectories for
linear programming problems,"
Mathematical Programming 50 (1991) 2951.
It also appeared in: J.C. Lagarias and M.J. Todd, eds.
Contemporary Mathematics:
Proceedings of the AMSIMSSIAM Joint Summer
Research Conference on "Mathematical Developments Arising from Linear
Programming," (Providence, Rhode Island, 1990) pp. 189211.

6) projective.pdf. (OK)
 R.D.C. Monteiro,
"Convergence and boundary behavior of the projective scaling
trajectories for linear programming,"
Mathematics of Operations Research 16 (1991) 842858.
It also appeared in: J.C. Lagarias and M.J. Todd, eds.
Contemporary Mathematics: Proceedings of
the AMSIMSSIAM Joint Summer
Research Conference on "Mathematical Developments Arising from Linear
Programming," Providence, Rhode Island, 1990, pp 213229.

7) sensi.pdf. (OK)
 I. Adler and R.D.C. Monteiro,
"A geometric view of parametric linear programming,"
Algorithmica 8 (1992) 161176.

8) potential.pdf. (OK)
 R.D.C. Monteiro, "On the continuous trajectories for a potential
reduction algorithm for linear programming,"
Mathematics of Operations Research 17 (1992) 225253.

9) convex.pdf. (OK)
 R.D.C. Monteiro, "A globally convergent primaldual interior point
algorithm for convex programming,"
Mathematical Programming 64 (1994) 123147.

10) primconv1.
 R.D.C. Monteiro, "The global convergence of a class of
primal potential reduction algorithms for convex programming,"
manuscript, SIE Dept., University of Arizona, Tucson, AZ 85721, 1991
(submitted to SIAM Journal on Optimization).

11) range.pdf. (OK)
 R.D.C. Monteiro and S. Mehrotra, "A General
Parametric Analysis Approach and Its Implication to Sensitivity
Analysis in Interior Point Methods,"
Mathematical Programming 72 (1996) 6582.

12) paper1.dvi,
paper.ps.
 R.D.C. Monteiro and S. Wright, "A globally and
superlinearly convergent potential reduction interior
point method for convex programming," SIE Working Paper 9213,
SIE Department, University of Arizona, Tucson, AZ 85721, 1992
(submitted to SIAM Journal on Optimization).

13) aff.pdf. (OK)
 R.D.C. Monteiro, T. Tsuchiya and Y. Wang, "A simplified
global convergence proof of the affine scaling algorithm,"
Annals of Operations Research 47 (1993) 443482.

14) supaff.pdf. (OK)
 T. Tsuchiya and R.D.C. Monteiro, "Superlinear convergence
of the affine scaling algorithm,"
Mathematical Programming 75 (1996) 77110.

15) lcp.pdf. (OK)
 R.D.C. Monteiro and T. Tsuchiya, "Limiting behavior of the
derivatives of certain trajectories associated with a monotone
horizontal linear complementarity problem,"
Mathematics of Operations Research 21 (1996) 793814.

16) positive.pdf. (OK)
 R.D.C. Monteiro, J.S. Pang, and T. Wang, "A Positive Algorithm
for the Nonlinear Complementarity Problem,"
SIAM Journal on Optimization 5 (1995) 129148.

17) jne.pdf. (OK)
 R.D.C. Monteiro and S. Wright: "Local convergence of
interiorpoint algorithms for degenerate monotone LCPs,"
Computational Optimization and Applications 3 (1993) 131155.

18) fas.pdf. (OK)
 R.D.C. Monteiro and S. Wright: "Superlinear primaldual
affine scaling algorithms for LCP,"
Mathematical Programming 69 (1995) 311333.

19) ias.pdf. (OK)
 R.D.C. Monteiro and S. Wright: "A superlinear
infeasibleinteriorpoint affine scaling algorithm for LCP,"
SIAM Journal on Optimization 6 (1996) 118.

20) gncp.pdf. (OK)
 R.D.C. Monteiro and J.S. Pang: "Properties of an interiorpoint
mapping for mixed complementarity problems,"
Mathematics of Operations Research 21 (1996) 629654.

21) nle.ps,
nle.pdf. (OK)
 T. Wang, R.D.C. Monteiro and J.S. Pang, "An interior point
potential reduction method for constrained equations,"
Mathematical Programming 74 (1996) 159195.

22) cp.pdf. (OK)
 R.D.C. Monteiro and F. Zhou, "On the Existence and Convergence
of the Central Path for Convex Programming and Some Duality Results,"
Computational Optimization and Applications 10 (1998) 5177.

23) pdeg.pdf. (OK)
 Y. Wang and R.D.C. Monteiro, "Nondegeneracy of polyhedra and
linear programs," Computational Optimization and Applications
7 (1997) 221237.

24) quadaff.dvi,
quadaff.ps,
quadaff.pdf. (OK)
 R.D.C. Monteiro and T. Tsuchiya: "Global convergence of the
affine scaling algorithm for convex quadratic programming,"
SIAM Journal on Optimization 8 (1998) 2658.

25) supconv.pdf. (OK)
 R.D.C. Monteiro and F. Zhou: "
On Superlinear Convergence of InfeasibleInteriorPoint
Algorithms for Linearly Constrained Convex Programs,"
Computational Optimization and Applications
8 (1997) 245262.

26) trust.pdf. (OK)
 R.D.C. Monteiro and Y. Wang: "
Trust Region Affine Scaling Algorithms for
Linearly Constrained Convex and Concave Programs,"
Mathematical Programming 80 (1998) 283313.

27) sdp.dvi,
sdp.ps,
sdp.pdf. (OK)
 R.D.C. Monteiro: "
PrimalDual PathFollowing Algorithms for Semidefinite Programming,"
SIAM Journal on Optimization 7 (1997) 663678.

28) gsncp.pdf. (OK)
 R.D.C. Monteiro and JongShi Pang: "
On Two InteriorPoint Mappings for Nonlinear Semidefinite
Complementarity Problems,"
Mathematics of Operations Research 23 (1998) 3960.

29) zhang.pdf. (OK)
 R.D.C. Monteiro and Y. Zhang: "
A Unified Analysis for a Class of PathFollowing PrimalDual
InteriorPoint Algorithms for Semidefinite Programming,"
Mathematical Programming 81 (1998) 281299.

30) note.pdf. (OK)
 R.D.C. Monteiro and P. Zanjacomo: "
A Note on the Existence of the AlizadehHaeberlyOverton
Direction for Semidefinite Programming,"
Mathematical Programming 78 (1997) 393396.

31) aho.dvi,
aho.ps,
aho.pdf. (OK)
 R.D.C. Monteiro: "Polynomial Convergence of
PrimalDual Algorithms for Semidefinite Programming Based
on Monteiro and Zhang Family of Directions,"
SIAM Journal on Optimization 8 (1998) 797812.

32) ksh.ps,
ksh.pdf. (OK)
 R.D.C. Monteiro and T. Tsuchiya: "
Polynomiality of PrimalDual Algorithms for
Semidefinite Linear Complementarity Problem Based
on the KojimaShindohHara Family of Directions,"
Mathematical Programming, 84 (1999) 3953.

33) mtfam.ps,
mtfam.pdf. (OK)
 R.D.C. Monteiro and T. Tsuchiya:
"Polynomial Convergence of a New Family of PrimalDual
Algorithms for Semidefinite Programming,"
SIAM Journal on Optimization 9 (1999) 551577.

34) nlesdp.pdf. (OK)
 R.D.C. Monteiro and J.S. Pang:
"A Potential Reduction Newton Method for Constrained Equations,"
SIAM Journal on Optimization 9 (1999) 729754.

35) dir5.dvi,
dir5.ps.
 R.D.C. Monteiro and P. Zanjacomo:
"Implementation of PrimalDual Methods for Semidefinite Programming
Based on Monteiro and Tsuchiya Newton Directions and their Variants,"
Optimization Methods and Software 11/12 (1999) 91140.

36) iusem.pdf. (OK)
 A. Iusem and R.D.C. Monteiro:
"On Dual Convergence of the Generalized Proximal
Point Method with Bregman Distances,"
Mathematics of Operations Research 25 (2000) 606624.

37) maps.pdf. (OK)
 R.D.C. Monteiro and P. Zanjacomo:
"General InteriorPoint Maps and Existence of Weighted
Paths for Nonlinear Semidefinite Complementarity Problems,"
Mathematics of Operations Research 25 (2000) 381399.

38) ahoice.dvi,
ahoice.ps,
ahoice.pdf. (OK)
 R.D.C. Monteiro and T. Tsuchiya:
"Polynomial Convergence of PrimalDual Algorithms for the
SecondOrder Cone Program Based on the MZFamily of Directions,"
Mathematical Programming 88 (2000) 6183.

39) maxcut.dvi,
maxcut.ps,
maxcut.pdf.
 S. Burer and R.D.C. Monteiro:
"A Projected Gradient Algorithm for Solving the Maxcut SDP Relaxation,"
Optimization Methods and Software 15 (2001) 175200.
K)

40) unify.pdf. (OK)
 S. Burer and R.D.C. Monteiro:
"A General Framework for Establishing Polynomial Convergence of
LongStep Methods for Semidefinite Programming",
Optimization Methods and Software 18 (2003) 138.

41) transf.dvi,
transf.ps.
 S. Burer, R.D.C. Monteiro and Y. Zhang:
"Solving Semidefinite Programs via Nonlinear Programming.
Part I: Transformations and Derivatives", working paper,
School of ISyE, Georgia Tech, USA, September 1999
(submitted to Mathematical Programming).

42) nlint.dvi,
nlint.ps.
 S. Burer, R.D.C. Monteiro and Y. Zhang:
"Solving Semidefinite Programs via Nonlinear Programming.
Part II: Interior Point Methods for a Subclass of SDPs", working paper,
School of ISyE, Georgia Tech, USA, October 1999
(submitted to Mathematical Programming).

42a) transf.dvi,
transf.ps,
transf.pdf. (OK)
(This is a revised version of the papers 41 and 42 which
have been merged to form the present paper.)
 S. Burer, R.D.C. Monteiro and Y. Zhang:
"Solving a class of semidefinite programs via nonlinear programming",
Mathematical Programming, 93 (2002) 97122.

43) gnlint.pdf. (OK)
 S. Burer, R.D.C. Monteiro and Y. Zhang:
"InteriorPoint Algorithms for Semidefinite Programming
Based on A Nonlinear Programming Formulation",
Computational Optimization and Applications 22 (2002) 4979.

44) r2mcut.dvi,
r2mcut.ps,
r2mcut.pdf. (OK)
 S. Burer, R.D.C. Monteiro and Y. Zhang:
"RankTwo Relaxation Heuristics for MaxCut and Other Binary
Quadratic Programs", SIAM Journal on Optimization
12 (2002) 503521.

45) stabset.ps,
stable.pdf. (OK)
 S. Burer, R.D.C. Monteiro and Y. Zhang:
"Maximum stable set formulations and heuristics
based on continuous optimization", Mathematical Programming
94 (2002) 137166.

46) lowrank.ps,
lowrank.pdf. (OK)
 S. Burer and R.D.C. Monteiro:
"A nonlinear programming algorithm for solving semidefinite programs
via lowrank factorization", Mathematical Programming,
Series B 95 (2003) 329357.

47) layered.pdf. (OK)
 R.D.C. Monteiro and T. Tsuchiya:
"A variant of the VavasisYe layeredstep interiorpoint algorithm
for linear programming", SIAM Journal on Optimization
13 (2003) 10541079.

48) dualimpl.ps,
dualimpl.pdf. (OK)
 S. Burer, R.D.C. Monteiro and Y. Zhang:
"A computational study of a gradientbased logbarrier algorithm for
a class of largescale SDPs", Mathematical Programming,
Series B 95 (2003) 359379.

49) layaff.ps,
layaff.pdf. (OK)
 R.D.C. Monteiro and T. Tsuchiya:
"A new iterationcomplexity bound for the MTY predictorcorrector
algorithm", SIAM Journal on Optimization 15 (2004) 319347.

50) sdptut.pdf. (OK)
 R.D.C. Monteiro:
"First and secondorder methods for semidefinite programming",
Mathematical Programming, Series B 97 (2003) 209244.

51) precond.ps,
precond.pdf. (OK)
 R.D.C. Monteiro, J.W. O'Neal and T. Tsuchiya:
"Uniform boundedness of a preconditioned normal matrix used in
interior point methods",
SIAM Journal on Optimization 15 (2004) 96100.

52) wpath.ps.
wpath.pdf. (OK)
 Z. Lu and R.D.C. Monteiro:
"Error bounds and limiting behavior of weighted paths
associated with the SDP map $X^{1/2}SX^{1/2}$",
SIAM Journal on Optimization 15 (2004) 348374.

53) centralpath.pdf. (OK)
 J.X. da Cruz Neto, O. P. Ferreira and R.D.C. Monteiro:
"Asymptotic behavior of the central path for a special class
of degenerate SDP problems", Mathematical Programming 103
(2005) 487514.

54) limaho.pdf. (OK)
 Z. Lu and R.D.C. Monteiro:
"Limiting behavior of the AlizadehHaeberlyOverton weighted paths in
semidefinite programming", Optimization Methods and Software
22 (2007) 849870.

55) lr.pdf (OK)
 S. Burer and R.D.C. Monteiro:
"Local minima and convergence in lowrank semidefinite programming",
Mathematical Programming 103 (2005) 427444.

56) lprecond.dvi,
lprecond.ps,
lprecond.pdf.
 R.D.C. Monteiro and J.W. O'Neal:
"Convergence analysis of a longstep primaldual infeasible
interiorpoint LP algorithm based on iterative linear solvers",
working paper, School of ISyE, Georgia Tech, USA, October 2003
(submitted to Mathematical Programming).

57) bregman.ps,
bregman.pdf. (OK)
 J.X. da Cruz Neto, O.P. Ferreira, A.N. Iusem and R.D.C. Monteiro:
"Dual convergence of the proximal point method with Bregman
distances for linear programming", Optimization Methods and
Software 22 (2007) 339360.

58) notekoj.ps,
notekoj.pdf. (OK)
 Z. Lu and R.D.C. Monteiro:
"A note on the local convergence of a predictorcorrector
interiorpoint algorithm for the semidefinite linear complementarity
problem based on the {AlizadehHaeberlyOverton} search direction",
SIAM Journal on Optimization 15 (2005) 11471154.

59) qpprecond.pdf. (OK)
 Z. Lu, R.D.C. Monteiro and J.W. O'Neal:
"An iterative solverbased infeasible primaldual pathfollowing
algorithm for convex quadratic programming",
SIAM Journal on Optimization 17 (2006) 287310.

60) tr.pdf. (OK)
 Z. Lu and R.D.C. Monteiro:
"A modified nearly exact method for solving lowrank trust region
subproblem", Mathematical Programming 109 (2007) 385411.

61) cg.dvi,
cg.ps,
cg.pdf.
 R.D.C. Monteiro, J.W. O'Neal and A. Nemirovski:
"A new conjugate gradient algorithm incorporating adaptive ellipsoid
preconditioning", working paper, School of ISyE, Georgia Tech, USA,
October 2004 (submitted to SIAM Journal on Optimization).

62) pmirror.pdf. (OK)
 Z. Lu, R.D.C. Monteiro and A. Nemirovski:
"Largescale semidefinite programming via saddle point
mirrorprox algorithm", Mathematical Programming 109
(2007) 211237.

63) gqpprecond.pdf. (OK)
 Z. Lu, R.D.C. Monteiro and J. O'Neal:
"An Iterative SolverBased LongStep Infeasible PrimalDual
PathFollowing Algorithm for Convex QP Based on a Class of
Preconditioners", Optimization Methods and Software
24 (2009) 123143.

64) curv.pdf. (OK)
 Z. R.D.C. Monteiro and T. Tsuchiya:
"A strong bound on the integral of the central path curvature
and its relationship with the iteration complexity of primaldual
pathfollowing LP algorithms", Mathematical Programming 115
(2008) 105149.

65) multridge.pdf. (OK)
 M. Yuan, A. Ekici, Z. Lu and R.D.C. Monteiro:
"Dimension Reduction and Coefficient Estimation in the Multivariate
Linear Regression", Journal of the Royal Statistical
Society, Series B 69 (2007) 329346.

66) pdfirst.pdf. (OK)
 G. Lan, Z. Lu and R.D.C. Monteiro:
"Primaldual firstorder methods with ${\cal O}(1/\epsilon)$
iterationcomplexity for cone programming",
Mathematical Programming 126 (2011) 129.

67) pctr.pdf. (OK)
 G. Lan, R.D.C. Monteiro and T. Tsuchiya:
"A polynomial predictorcorrector trustregion algorithm for linear
programming", SIAM Journal on Optimization
19 (2009) 19181946.

68) dimreduct.pdf. (OK)
 Z. Lu, R.D.C. Monteiro and M. Yuan:
"Convex optimization methods for dimension reduction and coefficient
estimation in multivariate linear regression",
Mathematical Programming 131 (2012) 163194.

69) penalty.pdf. (OK)
 G. Lan and R.D.C. Monteiro:
"Iterationcomplexity of firstorder penalty methods for convex
programming", Mathematical Programming 138 (2013) 115139.

70) benar.pdf. (OK)
 R.D.C. Monteiro and B.F. Svaiter:
"On the complexity of the hybrid proximal extragradient method
for the iterates and the ergodic mean",
SIAM Journal on Optimization 20 (2010) 27552787.

71) aug_lag.pdf. (OK)
 G. Lan and R.D.C. Monteiro:
"Iterationcomplexity of firstorder augmented Lagrangian methods
for convex programming",
Mathematical Programming 155 (2016) 511547.

72) sparsePCA.pdf.
 Y. He, R.D.C. Monteiro and H. Park:
"An efficient algorithm for single sparse PCA", working paper,
School of ISyE, Georgia Tech, USA, June 2010
(submitted to Proceedings of the Conference on Neural
Information Processing Systems(NIPS)).

73) genkorp.pdf. (OK)
 R.D.C. Monteiro and B.F. Svaiter:
"Complexity of variants of Tseng's modified FB splitting and
Korpelevich's methods for hemivariational inequalities
with applications to saddle point and convex optimization problems",
SIAM Journal on Optimization 21 (2011) 16881720.

74) blockdecom.pdf. (OK)
 R.D.C. Monteiro and B.F. Svaiter:
"Iterationcomplexity of blockdecomposition algorithms and
the alternating direction method of multipliers",
SIAM Journal on Optimization 23 (2013) 475507.

75) gradient.dvi,
gradient.ps,
gradient.pdf.
 R.D.C. Monteiro and B.F. Svaiter:
"Convergence rate of inexact proximal point methods
with relative error criteria for convex optimization",
working paper, School of ISyE, Georgia Tech, USA, August 2010
(submitted to SIAM Journal on Optimization).

76) newtonprox.pdf. (OK)
 R.D.C. Monteiro and B.F. Svaiter:
"Iterationcomplexity of a Newton proximal extragradient method for
monotone variational inequalities and inclusion problems",
SIAM Journal on Optimization 22 (2012) 914935.

77) proxaccel.pdf. (OK)
 R.D.C. Monteiro and B.F. Svaiter:
"An accelerated hybrid proximal extragradient method for convex
optimization and its implications to secondorder methods",
SIAM Journal on Optimization 23 (2013) 10921125.

78) ImplementationBD.pdf. (OK)
 R.D.C. Monteiro, C. Ortiz and B.F. Svaiter:
"Implementation of a blockdecomposition algorithm for solving
largescale conic semidefinite programming problems",
Computational Optimization and Applications 57 (2014) 4569.

79) 2EBDHPE.pdf. (OK)
 R.D.C. Monteiro, C. Ortiz and B.F. Svaiter:
"A firstorder blockdecomposition method for solving twoeasyblock
structured semidefinite programs",
Mathematical Programming Computation 6 (2014) 103150.

80) AA_method.pdf. (OK)
 R.D.C. Monteiro, C. Ortiz and B.F. Svaiter:
"An adaptive accelerated firstorder method for
convex optimization",
Computational Optimization and Applications
64 (2016) 3173;
DOI: 10.1007/s1058901598020.

81) schpe.pdf. (OK)
 R.D.C. Monteiro, M.R. Sicre and B.F. Svaiter:
"A hybrid proximal extragradient selfconcordant primal barrier
method for monotone variational inequalities",
SIAM Journal on Optimization 25 (2015) 19651996.

82) saddle_v4.pdf. (OK)
 Y. He and R.D.C. Monteiro:
"Accelerating blockdecomposition firstorder methods for solving
composite saddlepoint and twoplayer Nash equilibrium problems",
SIAM Journal on Optimization 25 (2015) 21822211.

83) CCISBD.pdf.
 R.D.C. Monteiro, C. Ortiz and B. F. Svaiter:
"An inexact blockdecomposition method for extra largescale conic
semidefinite programming" working paper, School of ISyE,
Georgia Tech, USA, December 2013.

84) bilinear_v5.pdf. (OK)
 Y. He and R.D.C. Monteiro:
"An accelerated HPEtype algorithm for a class of composite
convexconcave saddlepoint problems",
SIAM Journal on Optimization 26 (2016) 2956.

85) maicon.pdf.
 M. Marques Alves, R.D.C. Monteiro and B. F. Svaiter:
"Primaldual regularized SQP and SQCQP type methods for convex programming and their
complexity analysis", working paper, School of ISyE, Georgia Tech, USA,
May 2014.

86) stm_bmr.pdf. (OK)
 M. Marques Alves, R.D.C. Monteiro and B. F. Svaiter:
"Regularized HPEtype methods for solving monotone inclusions with improved pointwise
iterationcomplexity bounds",
SIAM Journal on Optimization 26 (2016) 27302743.

87) oliver.pdf. (OK)
 O. Kolossoski and R.D.C. Monteiro:
"An accelerated nonEuclidean hybrid proximal
extragradienttype algorithm for
convexconcave saddlepoint problems",
Optimization Methods and Software 32 (2017)
12441272. (DOI: 10.1080/10556788.2016.1266355)

88) rjatlanta.pdf.
 M. Marques Alves, R.D.C. Monteiro and B. F. Svaiter:
"Iterationcomplexity of a Rockafellar's proximal method of multipliers for
convex programming based on secondorder approximations",
Optimization published online, March 2019 (https://doi.org/10.1080/02331934.2019.1597357)

89) RENEHPE.pdf. (OK)
 M.L.N. Goncalves, J.G. Melo and R.D.C. Monteiro:
"Improved pointwise iterationcomplexity of a regularized ADMM and of a
regularized nonEuclidean HPE framework",
SIAM Journal on Optimization 27 (2017) 379407 (DOI: 10.1137/16M1055530).

90) DR.pdf. (OK)
 R.D.C. Monteiro and C.K. Sim:
"Complexity of the relaxed PeacemanRachford splitting method for the sum of
two maximal strongly monotone operators",
Computational Optimization and Applications 70 (2018) 763790.

91) ErgodicNEHPE.pdf.
 M.L.N. Goncalves, J.G. Melo and R.D.C. Monteiro:
"Extending the ergodic convergence rate of the proximal ADMM", working paper,
November 2016 (submitted to Optimization).

92) twoblocktheta.pdf.
 M.L.N. Goncalves, J.G. Melo and R.D.C. Monteiro: "Convergence rate bounds for a proximal ADMM with overrelaxation stepsize parameter for solving nonconvex linearly constrained problems", working paper,
February 3, 2017 (accepted in Pacific Journal of Optimization).

93) multiblocklinearized.pdf.
 J.G. Melo and R.D.C. Monteiro: "IterationComplexity of a Linearized Proximal Multiblock ADMM Class for Linearly Constrained Nonconvex Optimization Problems", working paper,
April 14, 2017.

94) multiblockjacobi.pdf.
 J.G. Melo and R.D.C. Monteiro,
"Iterationcomplexity of Jacobitype nonEuclidean ADMM for multiblock linearly constrained nonconvex programs",
working paper, May 13 , 2017.

95) nonconvexpenaltyacceleratedipp.pdf.
 W. Kong, J. G. Melo and R.D.C. Monteiro,
"Complexity of a quadratic penalty accelerated inexact proximal
point method for solving linearly constrained nonconvex composite programs",
working paper, February 14, 2018 (accepted in SIAM Journal on Optimization).

96) nonconvexadaptiveacceleratedipp.pdf.
 W. Kong, J. G. Melo and R.D.C. Monteiro,
"An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems”, working paper, December 2018 (submitted to Computational Optimization and its Applications).

97) nonconvexdoublyacceleratedcompositegradient.pdf.
 J. Liang and R.D.C. Monteiro,
"A Doubly Accelerated Inexact Proximal Point Method for Nonconvex Composite Optimization Problems
”, working paper,
December 2018 (submitted to SIAM Journal on Optimization).

98) nonconvexfistaacg.pdf.
 J. Liang, R.D.C. Monteiro and C.K. Sim,
"A FISTAtype accelerated gradient algorithm for solving
smooth nonconvex composite optimization problems”, working paper, May 16, 2019 (submitted to NIPS).

99) sp_AIPP.pdf.
 W. Kong and R.D.C. Monteiro,
"An accelerated inexact proximal point method for solving nonconvexconcave
minmax problems", working paper, May 30, 2019.

100) avg.curv.pdf.
 J. Liang and R.D.C. Monteiro,
"An average curvature accelerated composite gradient method for nonconvex smooth composite optimization problems",
working paper, June 2019 (in progress).

";
}
echo " Unique visitors since July 26, 2002";
?>
