A reformulation-linearization based algorithm for the smallest enclosing circle problem

DOI10.3934/jimo.2020136zbMath1476.90311OpenAlexW3080965612MaRDI QIDQ2666744

Yi Jiang, Yuan Cai

Publication date: 23 November 2021

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2020136

zbMATH Keywords

linear programmingsecond order cone programmingsmallest enclosing circle

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Uses Software

• SeDuMi

Cites Work

• Unnamed Item
• A simple algorithm for computing the smallest enclosing circle
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
• Efficient algorithms for the smallest enclosing ball problem
• Solution methodologies for the smallest enclosing circle problem
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• An efficient cutting plane algorithm for the smallest enclosing circle problem
• An efficient algorithm for the smallest enclosing ball problem in high dimensions
• Two Algorithms for the Minimum Enclosing Ball Problem
• Efficient Algorithms for the (Weighted) Minimum Circle Problem
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

This page was built for publication: A reformulation-linearization based algorithm for the smallest enclosing circle problem