Fetching the paper…
Reading the bibliography…
The objectives of this technical report is to provide additional results on the generalized conditional gradient methods introduced by Bredies et al.
Nonlinear programming
Dimitri P Bertsekas · 1999
Earlier work this paper cites.
The mosek interior point optimizer for linear programming: An implementation of the homogeneous algorithm
Erling Andersen and Knud Andersen · 2000
Earlier work this paper cites.
Nonmonotone spectral projected gradient methods on convex sets
Ernesto G Birgin, José Mario Martínez, and Marcos Raydan · 2000
Earlier work this paper cites.
Convex Analysis and Optimization
D. Bertsekas, A. Nedic, and A. Ozdaglar · 2003
Earlier work this paper cites.
Equivalence of a generalized conditional gradient method and the method of surrogate functionals
Kristian Bredies, Dirk Lorenz, and Peter Maass · 2005
Earlier work this paper cites.
Sparse multinomial logistic regression: Fast algorithms and generalization bounds
Balaji Krishnapuram, Lawrence Carin, Mario AT Figueiredo, and Alexander J Hartemink · 2005
Earlier work this paper cites.
Regularization and variable selection via the elastic net
Hui Zou and Trevor Hastie · 2005
Earlier work this paper cites.
Training a support vector machine in the primal
Olivier Chapelle · 2007
Earlier work this paper cites.
CVXOPT: A python package for convex optimization, 2008
Joachim Dahl and Lieven Vandenberghe · 2008
Cited alongside, same era.
The sinkhorn-knopp algorithm: Convergence and applications
Philip Knight · 2008
Cited alongside, same era.
Elastic-net regularization in learning theory
Christine De Mol, Ernesto De Vito, and Lorenzo Rosasco · 2009
Cited alongside, same era.
Optimizing costly functions with simple constraints: A limited-memory projected quasi-newton algorithm
Mark Schmidt, Ewout Berg, Michael Friedlander, and Kevin Murphy · 2009
Cited alongside, same era.
Joint covariate selection and joint subspace selection for multiple classification problems
G. Obozinski, B. Taskar, and M.I. Jordan · 2010
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transportation
Marco Cuturi · 2013
Fast computation of wasserstein barycenters
Marco Cuturi and Arnaud Doucet · 2014
Later among the works it cites.
Domain adaptation with regularized optimal transport
Nicolas Courty, Rémi Flamary, and Devis Tuia · 2014
Later among the works it cites.
Optimal transport with laplacian regularization: Applications to domain adaptation and shape matching
Rémi Flamary, Nicolas Courty, Devis Tuia, and Alain Rakotomamonjy · 2014
Later among the works it cites.
Regularized discrete optimal transport
Sira Ferradans, Nicolas Papadakis, Gabriel Peyré, and Jean-François Aujol · 2014
Later among the works it cites.
Optimal Transport with Proximal Splitting
N. Papadakis, G. Peyré, and E. Oudet · 2014
Later among the works it cites.
Non-convex relaxation of optimal transport for color transfer
Julien Rabin and Nicolas Papadakis · 2014
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.
Conditional gradient algorithms for norm-regularized smooth convex optimization
Zaid Harchaoui, Anatoli Juditsky, and Arkadi Nemirovski · 2013
Cited alongside, same era.
Revisiting frank-wolfe: Projection-free sparse convex optimization
Martin Jaggi · 2013
Cited alongside, same era.
Optimal transport for domain adaptation
Nicolas Courty, Rémi Flamary, Devis Tuia, and Alain Rakotomamonjy · 2015
Closest in time.