A dual simplex-type algorithm for the smallest enclosing ball of balls

DOI10.1007/s10589-021-00283-6zbMath1473.90159arXiv1812.01236OpenAlexW3164188315MaRDI QIDQ2044498

Marta Cavaleiro, Farid Alizadeh

Publication date: 9 August 2021

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.01236

zbMATH Keywords

second-order cone programmingsimplex-type methodssmallest enclosing ball of ballssmallest intersecting ball of balls

Mathematics Subject Classification ID

Nonlinear programming (90C30) Extreme-point and pivoting methods (90C49)

Related Items (max. 100)

The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\)

Uses Software

• SDPT3
• Mosek
• Miniball

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A numerically stable dual method for solving strictly convex quadratic programs
• A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\)
• On the ball spanned by balls
• Second-order cone programming
• Location science research: a review
• Efficient algorithms for the smallest enclosing ball problem
• Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls
• The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions
• Optimal core-sets for balls
• Applications of Convex Analysis to the Smallest Intersecting Ball Problem
• Two Algorithms for the Minimum Enclosing Ball Problem
• Approximate clustering via core-sets
• APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
• Factorized Variable Metric Methods for Unconstrained Optimization
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Methods for Modifying Matrix Factorizations
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
• A combinatorial bound for linear programming and related problems
• Approximate minimum enclosing balls in high dimensions using core-sets
• Algorithms - ESA 2003
• Choosing multiple parameters for support vector machines

This page was built for publication: A dual simplex-type algorithm for the smallest enclosing ball of balls