FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients

References

• Antonello N, Stella L, Patrinos P, van Waterschoot T (2018) Proximal gradient algorithms: Applications in signal processing. Preprint, submitted March 5, https://arxiv.org/abs/1803.01621.Google Scholar
• Bezanson J, Edelman A, Karpinski S, Shah VB (2017) Julia: A fresh approach to numerical computing. SIAM Rev. 59(1):65–98.Crossref, Google Scholar
• Braun G, Pokutta S, Zink D (2017) Lazifying conditional gradient algorithms. Precup D, Teh YW, eds. Proc. 34th Internat. Conf. Machine Learn., vol. 70 (PMLR, UK), 566–575.Google Scholar
• Braun G, Pokutta S, Tu D, Wright S (2019) Blended conditional gradients: The unconditioning of conditional gradients. Chaudhuri K, Salakhutdinov R, eds. Proc. 36th Internat. Conf. Machine Learn., vol. 97 (PMLR, UK), 735–743.Google Scholar
• Candès EJ, Recht B (2009) Exact matrix completion via convex optimization. Foundations Comput. Math. 9(6):717–772.Crossref, Google Scholar
• Candès EJ, Tao T (2010) The power of convex relaxation: Near-optimal matrix completion. IEEE Trans. Inform. Theory 56(5):2053–2080.Crossref, Google Scholar
• Candès EJ, Wakin MB (2008) An introduction to compressive sampling. IEEE Signal Processing Magazine 25(2):21–30.Crossref, Google Scholar
• Combettes CW, Pokutta S (2021) Complexity of linear minimization and projection on some sets. Oper. Res. Lett. 49(4):565–571.Crossref, Google Scholar
• Dunning I, Huchette J, Lubin M (2017) JuMP: A modeling language for mathematical optimization. SIAM Rev. 59(2):295–320.Crossref, Google Scholar
• Fazel M (2002) Matrix rank minimization with applications. PhD thesis, Stanford University, Stanford, CA.Google Scholar
• Frank M, Wolfe P (1956) An algorithm for quadratic programming. Naval Res. Logist. Quart. 3(1–2):95–110.Crossref, Google Scholar
• Guélat J, Marcotte P (1986) Some comments on Wolfe’s “away step.” Math. Programming 35(1):110–119.Crossref, Google Scholar
• Harper FM, Konstan JA (2015) The MovieLens datasets: History and context. ACM Trans. Interactive Intelligent Systems 5(4):Article 19.Google Scholar
• Hazan E, Luo H (2016) Variance-reduced and projection-free stochastic optimization. Balcan MF, Weinberger KQ, eds. Proc. 33th Internat. Conf. Machine Learn., vol. 48 (PMLR, UK), 1263–1271.Google Scholar
• Lacoste-Julien S, Jaggi M (2015) On the global linear convergence of Frank-Wolfe optimization variants. Cortes C, Lee DD, Sugiyama M, Garnett R, eds. Proc. 29th Conf. Neural Inform. Processing Systems, vol. 1 (MIT Press, Cambridge, MA), 496–504.Google Scholar
• Legat B, Dowson O, Garcia JD, Lubin M (2021a) MathOptInterface: A data structure for mathematical optimization problems. INFORMS J. Comput., ePub ahead of print October 22, https://doi.org/10.1287/ijoc.2021.1067.Google Scholar
• Legat B, Timme S, Deits R, de Laat D, Huchette J, Saba E, Forets M, Breiding P (2021b) JuliaAlgebra/MultivariatePolynomials.jl: v0.3.13. Accessed April 1, 2022, https://doi.org/10.5281/zenodo.4656033.Google Scholar
• Lehoucq RB, Sorensen DC, Yang C (1998) ARPACK Users’ Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• Levitin ES, Polyak BT (1966) Constrained minimization methods. USSR Comput. Math. Math. Phys. 6(5):1–50.Crossref, Google Scholar
• Mogensen PK, Riseth AN (2018) Optim: A mathematical optimization package for Julia. J. Open Source Software 3(24):Article 615.Crossref, Google Scholar
• Mokhtari A, Hassani H, Karbasi A (2020) Stochastic conditional gradient methods: From convex minimization to submodular maximization. J. Machine Learn. Res. 21(1):1–49.Google Scholar
• Orban D, Siqueira AS (2020) JSOSolvers.jl: JuliaSmoothOptimizers optimization solvers. Accessed April 1, 2022, https://github.com/JuliaSmoothOptimizers/JSOSolvers.jl.Google Scholar
• Pauphilet J, Bertsimas D, Cory-Wright R (2021) Mixed-projection conic optimization: A new paradigm for modeling rank constraints. Oper. Res., ePub ahead of print December 20, https://pubsonline.informs.org/doi/10.1287/opre.2021.2182.Google Scholar
• Pedregosa F, Negiar G, Askari A, Jaggi M (2020) Linearly convergent Frank–Wolfe with backtracking line-search. Chiappa S, Calandra R, eds. Proc. 23rd Internat. Conf. Artificial Intelligence Statist., vol. 108 (PMLR, UK), 1–10.Google Scholar
• Robbins H, Monro S (1951) A stochastic approximation method. Ann. Math. Statist. 22(3):400–407.Crossref, Google Scholar
• Tibshirani R (1996) Regression shrinkage and selection via the lasso. J. Roy. Statist. Soc. B 58(1):267–288.Crossref, Google Scholar
• Udell M, Townsend A (2019) Why are big data matrices approximately low rank? SIAM J. Math. Data Sci. 1(1):144–160.Crossref, Google Scholar
• Udell M, Mohan K, Zeng D, Hong J, Diamond S, Boyd S (2014) Convex optimization in Julia. 2014 First Workshop High Performance Tech. Comput. Dyn. Languages (IEEE, Piscataway, NJ), 18–28.Google Scholar