Relatively-Smooth Convex Optimization by First-Order Methods, and Applications

Fritz John, Extremum problems with inequalities as subsidiary conditions , in Studies and Essays, Presented to R. Courant on His 60th Birthday, Interscience, New York 30

1948

Earlier work this paper cites.

Jack Kiefer and Jacob Wolfowitz, The equivalence of two extremum problems , Canadian Journal of Mathematics 12

1960

Earlier work this paper cites.

Corwin L. Atwood, Optimal and efficient designs of experiments , The Annals of Mathematical Statistics (1969), 1570–1602

1969

Earlier work this paper cites.

M. Avriel, Nonlinear optimization: Analysis and methods , Prentice-Hall, 1976

1976

Earlier work this paper cites.

Arkadi Nemirovsky and David B. Yudin, Problem complexity and method efficiency in optimization , Wiley, New York, 1983

1983

Earlier work this paper cites.

Boris Polyak, Introduction to optimization , Optimization Software, Inc., New York, 1987

1987

Earlier work this paper cites.

Pravin M. Vaidya, A new algorithm for minimizing convex functions over convex sets , Foundations of Computer Science, 1989., 30th Annual Symposium on, IEEE, 1989, pp. 338–343

1989

Earlier work this paper cites.

Yinyu Ye, A new complexity result for minimizing a general quadratic function with a sphere constraint , Recent Advances in Global Optimization (C. Floudas and P. Pardalos, eds.), Princeton University Press, Princeton, NJ, 1992, pp. 19–31

1992

Earlier work this paper cites.

Leonid G. Khachiyan and Michael J Todd, On the complexity of approximating the maximal inscribed ellipsoid for a polytope , Mathematical Programming 61

1993

Earlier work this paper cites.

Kurt Anstreicher, Large step volumetric potential reduction algorithms for linear programming , Annals of Operations Research 62

1996

Cited alongside, same era.

Leonid G. Khachiyan, Rounding of polytopes in the real number model of computation , Mathematics of Operations Research 21

1996

Cited alongside, same era.

Yin Zhang, An interior-point algorithm for the maximum-volume ellipsoid problem , Department of Computational and Applied Mathematics, Rice University, Technical Report TR98-15 (1998)

1998

Cited alongside, same era.

Kurt M. Anstreicher, The volumetric barrier for semidefinite programming , Mathematics of Operations Research 25

2000

Cited alongside, same era.

Edwin M. Knorr, Raymond T. Ng, and Ruben H. Zamar, Robust space transformations for distance-based operations , Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2001, pp. 126–135

Peng Sun and Robert M. Freund, Computation of minimum-volume covering ellipsoids , Operations Research 52

2004

Later among the works it cites.

E. Alper Yildirim, On the minimum volume covering ellipsoid of ellipsoids , SIAM Journal on Optimization 17

2006

Later among the works it cites.

S. Damla Ahipasaoglu, Peng Sun, and Michael J. Todd, Linear convergence of a modified Frank-Wolfe algorithm for computing minimum volume enclosing ellipsoids , Optimization Methods and Software 23

2008

Later among the works it cites.

Robert M. Freund and Alexandre Belloni, On the second-order feasibility cone: Primal-dual representation and efficient projection , SIAM Journal on Optimization 19

2008

Later among the works it cites.

Paul Tseng, On accelerated proximal gradient methods for convex-concave optimization , Tech. report, May 21, 2008

2008

Later among the works it cites.