On the solution existence to convex polynomial programs and its applications (Q828698): Difference between revisions

In this nice and interesting paper a special convex constrained optimization problem is in the focus, where the objective function and the constraints functions are convex polynomials. Theorem 1 (in Section two) gives a necessary and sufficient condition for the existence of a solution for such problems. In the third section, stability problems are investigated. In the fourth one, an application to convex quadratic programming is shown, which is a solution of an open problem posed by \textit{D. S. Kim} et al. [Optim. Lett. 6, No. 2, 363--373 (2012; Zbl 1262.90120)]). Several examples makes the material more interesting and transparent.