Fetching the paper…
Reading the bibliography…
Greedy optimization methods such as Matching Pursuit (MP) and Frank-Wolfe (FW) algorithms regained popularity in recent years due to their simplicity, effectiveness and theoretical guarantees.
An algorithm for quadratic programming
M Frank and P Wolfe · 1956
Earlier work this paper cites.
Orthogonal least squares methods and their application to non-linear system identification
Sheng Chen, Stephen A Billings, and Wan Luo · 1989
Earlier work this paper cites.
Matching pursuits with time-frequency dictionaries
Stéphane Mallat and Zhifeng Zhang · 1993
Earlier work this paper cites.
Solving least squares problems
Charles L Lawson and Richard J Hanson · 1995
Earlier work this paper cites.
On the convergence of leveraging
Gunnar Rätsch, Sebastian Mika, Manfred K Warmuth, et al · 2001
Earlier work this paper cites.
The successive projections algorithm for variable selection in spectroscopic multicomponent analysis
Mário César Ugulino Araújo, Teresa Cristina Bezerra Saldanha, Roberto Kawakami Harrop Galvao, Takashi Yoneyama, Henrique Caldas Chame, and Valeria Visani · 2001
Earlier work this paper cites.
Algorithms for non-negative matrix factorization
Daniel D Lee and H Sebastian Seung · 2001
Earlier work this paper cites.
Positive tensor factorization
Max Welling and Markus Weber · 2001
Earlier work this paper cites.
Multiplicative updates for nonnegative quadratic programming in support vector machines
F Sha, LK Saul, and Daniel D Lee · 2002
Earlier work this paper cites.
An introduction to boosting and leveraging
Ron Meir and Gunnar Rätsch · 2003
Earlier work this paper cites.
Infinite-dimensional optimization and optimal design
Martin Burger · 2003
Earlier work this paper cites.
Greed is good: algorithmic results for sparse approximation
Joel A Tropp · 2004
Earlier work this paper cites.
Boosting, model selection, lasso and nonnegative garrote
P Bühlmann and B Yu · 2005
Earlier work this paper cites.
Non-negative tensor factorization with applications to statistics and computer vision
Amnon Shashua and Tamir Hazan · 2005
Earlier work this paper cites.
Boosting, model selection, lasso and nonnegative garrote
P Bühlmann and B Yu · 2005
Earlier work this paper cites.
Vertex component analysis: A fast algorithm to unmix hyperspectral data
José MP Nascimento and José MB Dias · 2005
Earlier work this paper cites.
Algorithms and applications for approximate nonnegative matrix factorization
Michael W Berry, Murray Browne, Amy N Langville, V Paul Pauca, and Robert J Plemmons · 2007
Earlier work this paper cites.
Algorithms and applications for approximate nonnegative matrix factorization
Michael W Berry, Murray Browne, Amy N Langville, V Paul Pauca, and Robert J Plemmons · 2007
Earlier work this paper cites.
Non-negative tensor factorization based on alternating large-scale non-negativity-constrained least squares
Hyunsoo Kim, Haesun Park, and Lars Elden · 2007
Earlier work this paper cites.
On the uniqueness of nonnegative sparse solutions to underdetermined systems of equations
Alfred M Bruckstein, Michael Elad, and Michael Zibulevsky · 2008
Earlier work this paper cites.
Fast local algorithms for large scale nonnegative matrix and tensor factorizations
Andrzej Cichocki and PHAN Anh-Huy · 2009
Earlier work this paper cites.
Boosting
Peter Bühlmann and Bin Yu · 2010
Earlier work this paper cites.
Sparse nonnegative matrix factorization using l0-constraints
Robert Peharz, Michael Stark, and Franz Pernkopf · 2010
Earlier work this paper cites.
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
Shai Shalev-Shwartz, Nathan Srebro, and Tong Zhang · 2010
Cited alongside, same era.
Nonlinear band expansion and 3d nonnegative tensor factorization for blind decomposition of magnetic resonance image of the brain
Ivica Kopriva and Andrzej Cichocki · 2010
Cited alongside, same era.
Generalized boosting algorithms for convex optimization
Alexander Grubb and J Andrew Bagnell · 2011
Cited alongside, same era.
Fast coordinate descent methods with variable selection for non-negative matrix factorization
Cho-Jui Hsieh and Inderjit S Dhillon · 2011
Cited alongside, same era.
Logistic regression with the nonnegative garrote
Enes Makalic and Daniel F Schmidt · 2011
Cited alongside, same era.
Greedy strategies for convex optimization
Hao Nguyen and Guergana Petrova · 2014
Later among the works it cites.
Greedy algorithms in convex optimization on Banach spaces
Vladimir Temlyakov · 2014
Later among the works it cites.
Rank-one matrix pursuit for matrix completion
Zheng Wang, Ming jun Lai, Zhaosong Lu, Wei Fan, Hasan Davulcu, and Jieping Ye · 2014
Later among the works it cites.
Tensor decompositions for learning latent variable models
Animashree Anandkumar, Rong Ge, Daniel J Hsu, Sham M Kakade, and Matus Telgarsky · 2014
Later among the works it cites.
Successive nonnegative projection algorithm for robust nonnegative blind source separation
Nicolas Gillis · 2014
Later among the works it cites.
Conditional gradient algorithms for norm-regularized smooth convex optimization
Zaid Harchaoui, Anatoli Juditsky, and Arkadi Nemirovski · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fast coordinate descent methods with variable selection for non-negative matrix factorization
Cho-Jui Hsieh and Inderjit S Dhillon · 2011
Cited alongside, same era.
Logistic regression with the nonnegative garrote
Enes Makalic and Daniel F Schmidt · 2011
Cited alongside, same era.
Fast nonnegative tensor factorization with an active-set-like method
Jingu Kim and Haesun Park · 2012
Cited alongside, same era.
A Hybrid Algorithm for Convex Semidefinite Optimization
Sören Laue · 2012
Cited alongside, same era.
Accelerated multiplicative updates and hierarchical als algorithms for nonnegative matrix factorization
Nicolas Gillis and François Glineur · 2012
Cited alongside, same era.
Fast nonnegative tensor factorization with an active-set-like method
Jingu Kim and Haesun Park · 2012
Cited alongside, same era.
A Hybrid Algorithm for Convex Semidefinite Optimization
Sören Laue · 2012
Cited alongside, same era.
Later among the works it cites.
On the Global Linear Convergence of Frank-Wolfe Optimization Variants
Simon Lacoste-Julien and Martin Jaggi · 2015
Later among the works it cites.
Polytope conditioning and linear convergence of the frank-wolfe algorithm
Javier Pena and Daniel Rodriguez · 2015
Later among the works it cites.
Greedy approximation in convex optimization
VN Temlyakov · 2015
Later among the works it cites.
Fast non-negative orthogonal matching pursuit
Mehrdad Yaghoobi, Di Wu, and Mike E Davies · 2015
Later among the works it cites.
Higher order Matching Pursuit for Low Rank Tensor Learning
Yuning Yang, Siamak Mehrkanoon, and Johan A K Suykens · 2015
Later among the works it cites.
Hierarchical clustering of hyperspectral images using rank-two nonnegative matrix factorization
Nicolas Gillis, Da Kuang, and Haesun Park · 2015
Later among the works it cites.
On the Global Linear Convergence of Frank-Wolfe Optimization Variants
Simon Lacoste-Julien and Martin Jaggi · 2015
Later among the works it cites.
Fast non-negative orthogonal matching pursuit
Mehrdad Yaghoobi, Di Wu, and Mike E Davies · 2015
Later among the works it cites.
A fast gradient method for nonnegative sparse regression with self dictionary
Nicolas Gillis and Robert Luce · 2016
Later among the works it cites.
Solving conic systems via projection and rescaling
Javier Pena and Negar Soheili · 2016
Later among the works it cites.
Greedy learning of generalized low-rank models
Quanming Yao and James T Kwok · 2016
Later among the works it cites.
A fast gradient method for nonnegative sparse regression with self dictionary
Nicolas Gillis and Robert Luce · 2016
Later among the works it cites.
Efficient sparse low-rank tensor completion using the Frank-Wolfe algorithm
Xiawei Guo, Quanming Yao, and James T Kwok · 2017
Closest in time.
A unified optimization view on generalized matching pursuit and frank-wolfe
Francesco Locatello, Rajiv Khanna, Michael Tschannen, and Martin Jaggi · 2017
Closest in time.
Efficient sparse low-rank tensor completion using the Frank-Wolfe algorithm
Xiawei Guo, Quanming Yao, and James T Kwok · 2017
Closest in time.
A unified optimization view on generalized matching pursuit and frank-wolfe
Francesco Locatello, Rajiv Khanna, Michael Tschannen, and Martin Jaggi · 2017
Closest in time.