Funder
National Foundation for Science and Technology Development
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference32 articles.
1. Ahmadi, A.A., Zhang, J.: On the complexity of testing attainment of the optimal value in nonlinear optimization. Math. Program. Ser. A 184, 221–241 (2020)
2. Bajbar, T., Behrends, S.: How fast do coercive polynomials grow? Instituts für Numerische und Angewandte Mathematik, Georg-August-Universität Göttingen, Tech. rep. (2017)
3. Bajbar, T., Stein, O.: Coercive polynomials and their Newton polytopes. SIAM J. Optim. 25(3), 1542–1570 (2015)
4. Bajbar, T., Stein, O.: Coercive polynomials: stability, order of growth, and Newton polytopes. Optimization 68(1), 99–124 (2019)
5. Bochnak, J., Coste, M., Roy, M.-F.: Real Algebraic Geometry, vol. 36. Springer, Berlin (1998)