Abstract
In this paper, we present a symbolic computation method for constructing a small neighborhood U around a known local optimal maximal or minimal point \(x_0\) of a given smooth function \(f: {\mathbb {R}}^n\rightarrow {\mathbb {R}}\) that contains radical or rational expressions of several variables, so that \(x_0\) is also the global optimal point of f(x) restricted to the small neighborhood U. The constructed small neighborhood can be used to prove that \(f(x_0)\) is the global optimum of f in a rather large region M with \(U\subset M\) via exact numeric computation like interval evaluation and branch-and-bound technology.
Supported by National Natural Science Foundation of China (12171159, 12071282).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Berman, J., Hanes, K.: Optimizing the arrangement of points on the unit sphere. Math. Comput. 31(140), 1006–1008 (1977)
Bollobas, B.: An extremal problem for polygons inscribed in a convex curve. Can. J. Math. 19, 523–528 (1967)
Bott, R.: Lectures on morse theory, old and new. Bull. Amer. Math. Soc. (N. S.) 7, 331–358 (1982)
Chattopadhyay, A., Vegter, G., Yap, C.K.: Certified computation of planar Morse-Smale complexes. J. Symb. Comput. 78, 3–40 (2017)
Hou, X.: Spherical Distribution of 5 points with maximal distance sum. Discrete Comput. Geom. 46, 156–174 (2011)
Loi, T.L., Phien, P.: The quantitative Morse theorem. Int. J. Math. Anal. 6(10), 481–491 (2012)
Morse, M.: The Calculus of Variations in the Large, vol. 18. American Mathematical Society Colloquium Publications, New York (1934)
Schur, V.: A quantitative version of the Morse lemma and ideal boundary fixing quasiisometries. J. Funct. Anal. 264(3), 815–836 (2013)
Stolarsky, K.B.: Sums of distances between points on a sphere. Proc. AMS 35(2), 547–549 (1972)
Stolarsky, K.B.: Sums of distances between points on a sphere II. Proc. AMS 41(2), 575–582 (1973)
Yomdin, Y.: The geometry of critical and near-critical values of differentiable mappings. Math. Annal. 264, 495–515 (1983)
Zeng, Z., Lu, J., Xu, Y., Wang, Y.: Maximizing the sum of the distances between four points on the unit hemisphere. In: Janičić, P., Kovács, Z. (eds.) Electronic Proceedings in Theoretical Computer Science, vol. 352, pp. 27–40 (2021)
Zeng, Z., Zhang, J.: A mechanical proof to a geometric inequality of Zirakzadeh through rectangular partition of polyhedra. J. Syst. Sci. Math. Sci. 30(11), 1430–1458 (2010)
Zirakzadeh, A.: A property of a triangle inscribed in a convex curve. Can. J. Math. 16, 778–786 (1964)
Acknowledgments
We are grateful to the anonymous reviewers of the ISSAC 2022 and the CASC 2022 for their insightful comments and helpful suggestions, both on mathematics and language aspects, to our manuscripts.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Zeng, Z., Xu, Y., Chen, Y., Yang, Z. (2022). A Mechanical Method for Isolating Locally Optimal Points of Certain Radical Functions. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2022. Lecture Notes in Computer Science, vol 13366. Springer, Cham. https://doi.org/10.1007/978-3-031-14788-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-031-14788-3_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-14787-6
Online ISBN: 978-3-031-14788-3
eBook Packages: Computer ScienceComputer Science (R0)