Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem
From MaRDI portal
Publication:2301135
DOI10.1007/s10589-019-00148-zzbMath1433.90130OpenAlexW2987279307WikidataQ126832414 ScholiaQ126832414MaRDI QIDQ2301135
Le Wang, Hui Sun, Wei-jie Cong
Publication date: 28 February 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-019-00148-z
linear convergenceminimum enclosing ballminimum volume enclosing ellipsoidFrank-Wolfe algorithm with away stepsrank-two update algorithmweighted Euclidean one-center
Cites Work
- Unnamed Item
- Unnamed Item
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
- Minimum-volume enclosing ellipsoids and core sets
- The weighted Euclidean 1-center problem
- An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions
- The Fermat-Weber location problem revisited
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Optimal core-sets for balls
- An Algorithm and a Core Set Result for the Weighted Euclidean One-Center Problem
- The Weighted Euclidean 1-Center Problem
- Two Algorithms for the Minimum Enclosing Ball Problem
- Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
- ε-Approximations for Multidimensional Weighted Location Problems
- The Minisum and Minimax Location Problems Revisited
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Single Facility $l_p $-Distance Minimax Location
- On the elimination of inessential points in the smallest enclosing ball problem
- Computation of Minimum-Volume Covering Ellipsoids
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem