Pages that link to "Item:Q2930345"

The following pages link to Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm (Q2930345):

Displaying 50 items.

• Greedy algorithms for prediction (Q265302) (← links)
• Convex optimization on Banach spaces (Q285434) (← links)
• Space exploration via proximity search (Q312150) (← links)
• Projection algorithms for nonconvex minimization with application to sparse principal component analysis (Q312468) (← links)
• Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee (Q331671) (← links)
• Convergence and rate of convergence of some greedy algorithms in convex optimization (Q338510) (← links)
• Approximation bounds for sparse principal component analysis (Q484129) (← links)
• An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
• Robust vertex enumeration for convex hulls in high dimensions (Q827269) (← links)
• A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm (Q1631800) (← links)
• Linear convergence rate for the MDM algorithm for the nearest point problem (Q1678696) (← links)
• An adaptive partial linearization method for optimization problems on product sets (Q1686667) (← links)
• A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization (Q1704920) (← links)
• Alternating conditional gradient method for convex feasibility problems (Q2044579) (← links)
• Complexity of linear minimization and projection on some sets (Q2060605) (← links)
• Performance analysis of greedy algorithms for minimising a maximum mean discrepancy (Q2104022) (← links)
• First-order methods for the convex hull membership problem (Q2106714) (← links)
• Duality gap estimates for a class of greedy optimization algorithms in Banach spaces (Q2117632) (← links)
• Biorthogonal greedy algorithms in convex optimization (Q2155817) (← links)
• Screening for a reweighted penalized conditional gradient method (Q2165597) (← links)
• Near-optimal coresets of kernel density estimates (Q2189735) (← links)
• Theorems of Carathéodory, Helly, and Tverberg without dimension (Q2197682) (← links)
• Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) (← links)
• A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
• Deterministic coresets for stochastic matrices with applications to scalable sparse PageRank (Q2327492) (← links)
• Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces (Q2337146) (← links)
• Greedy approximation in convex optimization (Q2343051) (← links)
• Efficient algorithms for privately releasing marginals via convex relaxations (Q2349860) (← links)
• Polynomial time approximation schemes for all 1-center problems on metric rational set similarities (Q2663710) (← links)
• Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm (Q2689818) (← links)
• On the von Neumann and Frank-Wolfe algorithms with away steps (Q2789610) (← links)
• The geometry of differential privacy: the small database and approximate cases (Q2805515) (← links)
• Conditional gradient sliding for convex optimization (Q2816241) (← links)
• Scalable robust matrix recovery: Frank-Wolfe meets proximal methods (Q2830569) (← links)
• Core-Sets: Updated Survey (Q3297370) (← links)
• Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization (Q3391453) (← links)
• (Q4558556) (← links)
• (Q4614130) (← links)
• On the elimination of inessential points in the smallest enclosing ball problem (Q4622883) (← links)
• (Q4633024) (← links)
• On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression (Q4634678) (← links)
• Generalized Conditional Gradient for Sparse Estimation (Q4637076) (← links)
• Simplified versions of the conditional gradient method (Q4646556) (← links)
• Sparse Approximation via Generating Point Sets (Q4972677) (← links)
• Non-Negative Sparse Regression and Column Subset Selection with L1 Error (Q4993270) (← links)
• Scalable Semidefinite Programming (Q4999352) (← links)
• Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning (Q5055686) (← links)
• Fast Cluster Detection in Networks by First Order Optimization (Q5065475) (← links)
• Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
• Generating Neural Archetypes to Instruct Fast and Interpretable Decisions (Q5114913) (← links)