کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1142956 1489586 2012 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Exact SDP relaxations for classes of nonlinear semidefinite programming problems
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Exact SDP relaxations for classes of nonlinear semidefinite programming problems
چکیده انگلیسی

This paper addresses the issue of which nonlinear semidefinite linear programming problems possess exact semidefinite linear programming (SDP) relaxations under a constraint qualification. We establish exact SDP relaxations for classes of nonlinear semidefinite programming problems with SOS-convex polynomials. These classes include SOS-convex semidefinite programming problems and fractional semidefinite programming problems with SOS-convex polynomials. The class of SOS-convex polynomials contains convex quadratic functions and separable convex polynomials. We also derive numerically checkable conditions, completely characterizing minimizers of these classes of problems.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Operations Research Letters - Volume 40, Issue 6, November 2012, Pages 529–536
نویسندگان
, ,