کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5775656 | 1631741 | 2017 | 19 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In this paper we examine semidefinite linear programming approximations to a class of semi-infinite convex polynomial optimization problems, where the index sets are described in terms of convex quadratic inequalities. We present a convergent hierarchy of semidefinite linear programming relaxations under a mild well-posedness assumption. We also provide additional conditions under which the hierarchy exhibits finite convergence. These results are derived by first establishing characterizations of optimality which can equivalently be reformulated as linear matrix inequalities. A separation theorem of convex analysis and a sum-of-squares polynomial representation of positivity of real algebraic geometry together with a special variable transformation play key roles in achieving the results. Finally, as applications, we present convergent relaxations for a broad class of robust convex polynomial optimization problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 315, 15 December 2017, Pages 381-399
Journal: Applied Mathematics and Computation - Volume 315, 15 December 2017, Pages 381-399
نویسندگان
T.D. Chuong, V. Jeyakumar,