Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
From MaRDI portal
Publication:2930345
DOI10.1145/1824777.1824783zbMath1300.90026OpenAlexW2109706083WikidataQ56570068 ScholiaQ56570068MaRDI QIDQ2930345
Publication date: 18 November 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1824777.1824783
Convex programming (90C25) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items
Greedy algorithms for prediction, Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries, Robust vertex enumeration for convex hulls in high dimensions, Convex optimization on Banach spaces, A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm, Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning, Space exploration via proximity search, Projection algorithms for nonconvex minimization with application to sparse principal component analysis, ON THE BOUNDEDNESS OF AN ITERATION INVOLVING POINTS ON THE HYPERSPHERE, Fast Cluster Detection in Networks by First Order Optimization, Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee, Unnamed Item, Biorthogonal greedy algorithms in convex optimization, Convergence and rate of convergence of some greedy algorithms in convex optimization, Screening for a reweighted penalized conditional gradient method, Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search, Polynomial time approximation schemes for all 1-center problems on metric rational set similarities, Linear convergence rate for the MDM algorithm for the nearest point problem, Riemannian optimization via Frank-Wolfe methods, An adaptive partial linearization method for optimization problems on product sets, Near-optimal coresets of kernel density estimates, Spreading points using gradient and tabu, A generalized conditional gradient method for dynamic inverse problems with optimal transport regularization, Conic optimization-based algorithms for nonnegative matrix factorization, The Frank-Wolfe algorithm: a short introduction, Unnamed Item, Theorems of Carathéodory, Helly, and Tverberg without dimension, Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers, Generating Neural Archetypes to Instruct Fast and Interpretable Decisions, Making Sense of Economics Datasets with Evolutionary Coresets, Utility/privacy trade-off as regularized optimal transport, A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization, Bayesian Quadrature, Energy Minimization, and Space-Filling Design, Active Set Complexity of the Away-Step Frank--Wolfe Algorithm, Mass Customization and “Forecasting Options’ Penetration Rates Problem”, On the elimination of inessential points in the smallest enclosing ball problem, Non-Negative Sparse Regression and Column Subset Selection with L1 Error, Core-Sets: Updated Survey, Approximation bounds for sparse principal component analysis, On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression, Frank-Wolfe and friends: a journey into projection-free first-order optimization methods, Simplified versions of the conditional gradient method, Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints, An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity, Unnamed Item, On the von Neumann and Frank--Wolfe Algorithms with Away Steps, The Geometry of Differential Privacy: The Small Database and Approximate Cases, Sparse Approximation via Generating Point Sets, On coresets for support vector machines, Alternating conditional gradient method for convex feasibility problems, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, Conditional Gradient Sliding for Convex Optimization, Chebyshev centres, Jung constants, and their applications, Unnamed Item, Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization, Complexity of linear minimization and projection on some sets, Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods, First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants, Generalized Conditional Gradient for Sparse Estimation, Unnamed Item, An active-set algorithmic framework for non-convex optimization problems over the simplex, Scalable Semidefinite Programming, Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces, Unnamed Item, Greedy approximation in convex optimization, Performance analysis of greedy algorithms for minimising a maximum mean discrepancy, First-order methods for the convex hull membership problem, Efficient algorithms for privately releasing marginals via convex relaxations, Duality gap estimates for a class of greedy optimization algorithms in Banach spaces
