Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point (2310.06185v2)

Published 9 Oct 2023 in math.OC and cs.DM

Abstract: In this paper we study the problem of maximizing the distance to a given point $C_0$ over a polytope $\mathcal{P}$. Assuming that the polytope is circumscribed by a known ball we construct an intersection of balls which preserves the vertices of the polytope on the boundary of this ball, and show that the intersection of balls approximates the polytope arbitrarily well. Then, we use some known results regarding the maximization of distances to a given point over an intersection of balls to create a new polytope which preserves the maximizers to the original problem. Next, a new intersection of balls is obtained in a similar fashion, and as such, after a finite number of iterations, we conjecture, we end up with an intersection of balls over which we can maximize the distance to the given point. The obtained distance is shown to be a non trivial upper bound to the original distance. Tests are made with maximizing the distance to a random point over the unit hypercube up to dimension $n = 100$. Several detailed 2-d examples are also shown.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (37)
  1. Ball-Polyhedra. Discrete Comput Geom 38, 201–230 (2007) https://doi.org/10.1007/s00454-007-1334-7
  2. K. Bezdek Classical Topics in Discrete Geometry, CMS Books in Mathematics, Springer, New York, 2010
  3. K. Bezdek Lectures on Sphere Arrangements - the Discrete Geometric Side, Fields Institute Monographs, Springer, New York, 2013
  4. H. Martini, L. Montejano and D. Oliveros Bodies of Constant Width - An Introduction to Convex Geometry with Applications, Birkhauser, Cham, 2019
  5. M. Costandin On computing the maximum distance to a fixed point over an intersection of balls accepted to Studia Scientiarum Mathematicarum Hungarica: Combinatorics, Geometry and Topology. Under review 2’nd round. Online draft here https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4432464
  6. M. Costandin On Maximizing the Distance to a Given Point over an Intersection of Balls II https://arxiv.org/abs/2307.13015
  7. Zwart, P. B Global maximization of a convex function with linear inequality constraints Operations Research, 22(3):602–609
  8. Recent Theoretical Advances in Non-Convex Optimization https://arxiv.org/abs/2012.06188
  9. D. Wojtczak On Strong NP-Completeness of Rational Problems https://arxiv.org/abs/1802.09465
  10. R. Enhbat An Algorithm for Maximizing a Convex Function over a Simple Set Journal of Global Optimization 8: 37 391, 1996 Kluwer Academic Publishers
  11. On Indefinite Quadratic Optimization over the Intersection of Balls and Linear Constraints J Optim Theory Appl 194, 246–264 (2022) https://doi.org/10.1007/s10957-022-02018-x
  12. On maximization of quadratic form over intersection of ellipsoids with common center Math. Program., Ser. A 86: 463–473 (1999)
  13. Chebyshev Center of the Intersection of Balls: Complexity, Relaxation and Approximation https://arxiv.org/pdf/1901.07645.pdf
  14. A. Beck On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls J Glob Optim (2007) 39:113–126 DOI 10.1007/s10898-006-9127-8
  15. A. Beck, D. Pan A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints J Glob Optim DOI 10.1007/s10898-017-0521-1, 2017
  16. P. L. DE Angelis, I. M. Bomze and G. Toraldo Ellipsoidal Approach to Box-Constrained Quadratic Problems Journal of Global Optimization 28: 1–15, 2004, 2004 Kluwer Academic Publishers. Printed in the Netherlands
  17. D. Y. Gao, N. Ruan Solutions to quadratic minimization problems with box and integer constraints J Glob Optim (2010) 47:463–484, DOI10.1007/s10898-009-9469-0
  18. L. T. H. An and P. D. Tao A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems Journal of Global Optimization 13: 171–206, 1998, 1998 Kluwer Academic Publishers. Printed in the Netherlands.
  19. Károly Bezdek Volumetric bounds for intersections of congruent balls in Euclidean spaces Aequationes mathematicae volume 95, pages653–665 (2021)
  20. Károly Bezdek On the intrinsic volumes of intersections of congruent balls Discrete Optimization Volume 44, Part 1, May 2022, 100539
  21. S. Nanda Subset Sum Problem https://www.cs.dartmouth.edu/~ac/Teach/CS105-Winter05/Notes/nanda-scribe-3.pdf
  22. K. Koiliaris, C. Xu A Faster Pseudopolynomial Time Algorithm for Subset Sum ACM Transactions on Algorithms, Volume 15, Issue 3 July 2019 Article No.: 40, pp 1–20
  23. K. Bringmann A near-linear pseudopolynomial time algorithm for subset sum In Klein, Philip N. (ed.). Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017). SIAM. pp. 1073–1084
  24. An efficient fully polynomial approximation scheme for the Subset-Sum Problem Journal of Computer and System Sciences 66 (2003) 349–370
  25. V. V. Curtis, C. A. Sanches, A low-space algorithm for the subset-sum problem on GPU Computers & Operations Research. 83: 120–124
  26. S. Sahni Computationally Related Problems SIAM J Comput, vol. 3, nr. 4, 1974
  27. B. T. Polyak Minimization Of Unsmooth Functionals Moscow 1968
  28. B. T Polyak A general method for solving extremal problems. DokE. Akad. Nauk SSSR. 174, 1, 33-36, 1967.
  29. B.T. Polyak Introduction to Optimization Optimization Software New York
  30. Proximal algorithms Foundations and Trends in Optimization 1 123–231, 2013
  31. S. Boyd Subgradient Methods Notes for EE364b, Stanford University, Spring 2013–14
  32. Linear Matrix Inequalities in System and Control Theory Society for Industrial and Applied Mathematics, 1994
  33. Quadratic optimization In: Handbook of global optimization, pp. 217-269. Springer, 1995
  34. R. G. Bland, D. Goldfarb and M. J. Todd The Ellipsoid Method: A Survey Cornell University, Ithaca, New York, 1981
  35. H. Bauschke, J. M. Borwein On Projection Algorithms for Solving Convex Feasibility Problems SIAM Review, 38(3), 1996.
  36. S. Bubeck Convex Optimization: Algorithms and Complexity Foundations and Trends in Machine Learning Vol. 8, No. 3-4 (2015) 231–357 Knapsack Problems Springer 2004, ISBN 978-3-540-24777-7
  37. Convex Optimization Cambridge University Press 2004

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now