Pages that link to "Item:Q5459815"

The following pages link to Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids (Q5459815):

Displaying 34 items.

• Rank-two update algorithms for the minimum volume enclosing ellipsoid problem (Q434159) (← links)
• A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training (Q508681) (← links)
• Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem (Q968187) (← links)
• Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations (Q1640558) (← links)
• Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach (Q1675553) (← links)
• Solving conic systems via projection and rescaling (Q1683682) (← links)
• A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms (Q1941215) (← links)
• A branch-and-bound algorithm for the exact optimal experimental design problem (Q2058883) (← links)
• Performance analysis of greedy algorithms for minimising a maximum mean discrepancy (Q2104022) (← links)
• Computing minimum-volume enclosing ellipsoids for large datasets (Q2129596) (← links)
• A Newton Frank-Wolfe method for constrained self-concordant minimization (Q2141726) (← links)
• Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) (← links)
• Efficient formulations for pricing under attraction demand models (Q2248752) (← links)
• Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem (Q2301135) (← links)
• Fast algorithms for the minimum volume estimator (Q2349524) (← links)
• On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) (← links)
• On the minimum volume simplex enclosure problem for estimating a linear mixing model (Q2392121) (← links)
• Local generalized quadratic distance metrics: application to the \(k\)-nearest neighbors classifier (Q2418363) (← links)
• A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria (Q2439646) (← links)
• Nonlinear set membership filter with state estimation constraints via consensus-ADMM (Q2681381) (← links)
• On the von Neumann and Frank-Wolfe algorithms with away steps (Q2789610) (← links)
• A linearly convergent algorithm for solving the minimum volume axis-aligned ellipsoid problem (Q2885944) (← links)
• Enhancing Pure-Pixel Identification Performance via Preconditioning (Q3192648) (← links)
• Relatively Smooth Convex Optimization by First-Order Methods, and Applications (Q4603043) (← links)
• On the elimination of inessential points in the smallest enclosing ball problem (Q4622883) (← links)
• Linear convergence of accelerated conditional gradient algorithms in spaces of measures (Q4999535) (← links)
• On directional Whitney inequality (Q5080878) (← links)
• Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies (Q5200559) (← links)
• Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm (Q5219705) (← links)
• Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization (Q5252582) (← links)
• A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization (Q5741072) (← links)
• A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach (Q5963815) (← links)
• Computing minimum-volume enclosing ellipsoids (Q6062882) (← links)
• First-order methods for convex optimization (Q6169988) (← links)