Fetching the paper…
Reading the bibliography…
We present and analyze a new generalized Frank-Wolfe method for the composite optimization problem $(P):{\min}_{x\in\mathbb{R}^n}\; f(\mathsf{A} x) + h(x)$, where $f$ is a $\theta$-logarithmically-homogeneous self-concordant barrier, $\mathsf{A}$ is a linear operator and the function $h$ has bounded domain but is possibly non-smooth.
in Studies and Essays, Presented to R. Courant on His 60th Birthday, Interscience, New York 30
John, F.: Extremum problems with inequalities as subsidiary conditions · 1948
Earlier work this paper cites.
Nav. Res. Logist. Q. 3
Frank, M., Wolfe, P.: An algorithm for quadratic programming · 1956
Earlier work this paper cites.
Canadian Journal of Mathematics 12
Kiefer, J., Wolfowitz, J.: The equivalence of two extremum problems · 1960
Earlier work this paper cites.
USSR Comput. Math. Math. Phys. 6
Levitin, E., Polyak, B.: Constrained minimization methods · 1966
Earlier work this paper cites.
SIAM Journal on Control (1967)
Demyanov, V., Rubinov, A.: The minimization of a smooth convex functional on a convex set · 1967
Earlier work this paper cites.
SIAM J. Control 6
Canon, M.D., Cullum, C.D.: A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm · 1968
Earlier work this paper cites.
The Annals of Mathematical Statistics pp. 1570–1602 (1969)
Atwood, C.L.: Optimal and efficient designs of experiments · 1969
Earlier work this paper cites.
Academic Press (1972)
Fedorov, V.V.: Theory of Optimal Experiments · 1972
Earlier work this paper cites.
IEEE Trans. Nucl. Sci. 21
Shepp, L.A., Logan, B.F.: The Fourier reconstruction of a head section · 1974
Earlier work this paper cites.
Journal of Mathematical Analysis and Applications 62
Dunn, J., Harshbarger, S.: Conditional gradient algorithms with open loop step size rules · 1978
Earlier work this paper cites.
SIAM Journal on Control and Optimization 17
Dunn, J.: Rates of convergence for conditional gradient algorithms near singular and nonsinglular extremals · 1979
Earlier work this paper cites.
Ekonomika i Matematicheskie Metody (in Russian) 15
Nemirovskii, A., Yudin, D.: Efficient methods for large-scale convex problems · 1979
Earlier work this paper cites.
SIAM Journal on Control and Optimization 18
Dunn, J.: Convergence rates for conditional gradient sequences generated by implicit step length rules · 1980
Earlier work this paper cites.
IEEE Trans. Med. Imaging 1
Shepp, L.A., Vardi, Y.: Maximum likelihood reconstruction for emission tomography · 1982
Earlier work this paper cites.
IEEE Transactions on Information Theory 30
Cover, T.: An algorithm for maximizing expected log investment return · 1984
Earlier work this paper cites.
Ann. Prob. 16
Algoet, P.H., Cover, T.M.: Asymptotic Optimality and Asymptotic Equipartition Properties of Log-Optimum Investment · 1988
Earlier work this paper cites.
SIAM Review 31
Hager, W.: Updating the inverse of a matrix · 1989
Earlier work this paper cites.
J Optim. Theory Appl. 73
Censor, Y., Zenios, S.: Proximal minimization algorithm with D-functions · 1992
Earlier work this paper cites.
Phys. D: Nonlinear Phenom. 60
Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms · 1992
Earlier work this paper cites.
Math. Oper. Res. 18
Eckstein, J.: Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming · 1993
Earlier work this paper cites.
J. R. Stat. Soc. Ser. B 55
Vardi, Y., Lee, D.: From image deblurring to optimal investments: Maximum likelihood solutions for positive linear inverse problems · 1993
Earlier work this paper cites.
SIAM (1994)
Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming · 1994
Cited alongside, same era.
IEEE Trans. Med. Imaging 14
de Pierro, A.R.: On the convergence of an em-type algorithm for penalized likelihood estimation in emission tomography · 1995
Cited alongside, same era.
Mathematics of Operations Research 21
Khachiyan, L.G.: Rounding of polytopes in the real number model of computation · 1996
Cited alongside, same era.
Math. Oper. Res. 24
Auslender, A., Teboulle, M., Ben-Tiba, S.: Interior proximal and multiplier methods based on second order homogeneous kernels · 1999
Cited alongside, same era.
SIAM J. Optim. 12
Ben-Tal, A., Margalit, T., Nemirovski, A.: The ordered subsets mirror descent optimization method with applications to tomography · 2001
Cited alongside, same era.
In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 126–135. ACM (2001)
Knorr, E.M., Ng, R.T., Zamar, R.H.: Robust space transformations for distance-based operations · 2001
J. Mach. Learn. Res. 16
Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: Composite self-concordant minimization · 2015
Later among the works it cites.
J. Mach. Learn. Res. 17
Diamond, S., Boyd, S.: CVXPY: A Python-embedded modeling language for convex optimization · 2016
Later among the works it cites.
Math. Program. 155
Freund, R.M., Grigas, P.: New analysis and results for the Frank-Wolfe method · 2016
Later among the works it cites.
Ph.D. thesis, Massachusetts Institute of Technology (2016)
Grigas, P.: Methods for convex optimization and statistical learning · 2016
Later among the works it cites.
In: Proc. ICASSP, pp. 6230–6234 (2016)
Odor, G., Li, Y.H., Yurtsever, A., Hsieh, Y.P., Tran-Dinh, Q., Halabi, M.E., Cevher, V.: Frank-Wolfe works for non-Lipschitz continuous gradient objectives: Scalable Poisson phase retrieval · 2016
Later among the works it cites.
SIAM (2016)
Todd, M.J.: Minimum-Volume Ellipsoids: Theory and Algorithms · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
SIAM, Philadelphia, PA, USA (2001)
Renegar, J.: A Mathematical View of Interior-point Methods in Convex Optimization · 2001
Cited alongside, same era.
Statistics and Computing 12
Croux, C., Haesbroeck, G., Rousseeuw, P.J.: Location adjustment for the minimum volume ellipsoid estimator · 2002
Cited alongside, same era.
Cambridge University Press (2004)
Boyd, S., Vandenberghe, L.: Convex Optimization · 2004
Cited alongside, same era.
Springer (2004)
Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course · 2004
Cited alongside, same era.
Operations Research 52
Sun, P., Freund, R.M.: Computation of minimum-volume covering ellipsoids · 2004
Cited alongside, same era.
Microsc. Res. Tech. 69
Dey, N., Blanc-Féraud, L., Zimmer, C., Roux, P., Kam, Z., Olivo-Marin, J., Zerubia, J.: Richardson–Lucy algorithm with total variation regularization for 3D confocal microscope deconvolution · 2006
Cited alongside, same era.
Math. Oper. Res. 42
Bauschke, H.H., Bolte, J., Teboulle, M.: A descent lemma beyond lipschitz gradient continuity: First-order methods revisited and applications · 2017
Later among the works it cites.
SIAM J. Optim. 27
Freund, R.M., Grigas, P., Mazumder, R.: An extended Frank-Wolfe method with in face directions, and its application to low-rank matrix completion · 2017
Later among the works it cites.
SIAM J. Optim. 28
Chambolle, A., Ehrhardt, M.J., Richtárik, P., Schónlieb, C.B.: Stochastic primal-dual hybrid gradient algorithm with arbitrary sampling and imaging applications · 2018
Later among the works it cites.
URL https://www.cs.cornell.edu/courses/cs4670/2018sp/lec04-filtering2.pdf
Hariharan, B.: All about convolution (2018) · 2018
Later among the works it cites.
SIAM J. Optim. 28
Lu, H., Freund, R.M., Nesterov, Y.: Relatively smooth convex optimization by first-order methods, and applications · 2018
Later among the works it cites.
Math. Program. 171
Nesterov, Y.: Complexity bounds for primal-dual methods minimizing the model of objective function · 2018
Later among the works it cites.
Math. Program. 173
Ghadimi, S.: Conditional gradient type methods for composite nonlinear and stochastic optimization · 2019
Later among the works it cites.
Doikov, N., Nesterov, Y.: Affine-invariant contracting-point methods for convex optimization · 2020
Closest in time.
In: Proc. ICML, pp. 2814–2824 (2020)
Dvurechensky, P., Ostroukhov, P., Safin, K., Shtern, S., Staudigl, M.: Self-Concordant Analysis of Frank-Wolfe Algorithms · 2020
Closest in time.
Liu, D., Cevher, V., Tran-Dinh, Q.: A Newton Frank-Wolfe Method for Constrained Self-Concordant Minimization · 2020
Closest in time.
Stonyakin, F., Tyurin, A., Gasnikov, A., Dvurechensky, P., Agafonov, A., Dvinskikh, D., Alkousa, M., Pasechnyuk, D., Artamonov, S., Piskunova, V.: Inexact Relative Smoothness and Strong Convexity for Optimization and Variational Inequalities by Inexact Model · 2020
Closest in time.
Yang, C., Fan, J., Wu, Z., Udell, M.: Efficient AutoML pipeline search with matrix and tensor factorization (2020)
2020
Closest in time.
URL http://www.gurobi.com
Gurobi Optimization, L.: Gurobi optimizer reference manual (2021) · 2021
Closest in time.
Mathematical Programming 187
Lu, H., Freund, R.: Generalized stochastic Frank-Wolfe algorithm with stochastic “substitute” gradient for structured convex optimization · 2021
Closest in time.