Semidefinite Program Duals for Separable Polynomial Programs Involving Box Constraints

Thai Doan Chuong ()
Additional contact information
Thai Doan Chuong: Ton Duc Thang University

Journal of Optimization Theory and Applications, 2020, vol. 185, issue 1, No 16, 289-299

Abstract: Abstract We show that a separable polynomial program involving a box constraint enjoys a dual problem, that can be displayed in terms of sums of squares univariate polynomials. Under convexification and qualification conditions, we prove that a strong duality relation between the underlying separable polynomial problem and its corresponding dual holds, where the dual problem can be reformulated and solved as a semidefinite programming problem.

Keywords: Polynomial program; Semidefinite linear program; Dual problem; Slater’s condition; Box constraint; 49K99; 65K10; 90C29; 90C46 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-020-01646-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:185:y:2020:i:1:d:10.1007_s10957-020-01646-5

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-020-01646-5

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().