On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems

Feng Guo () and Xiaoxia Sun ()
Additional contact information
Feng Guo: Dalian University of Technology
Xiaoxia Sun: Dongbei University of Finance and Economics

Computational Optimization and Applications, 2020, vol. 75, issue 3, No 5, 669-699

Abstract: Abstract We consider the semi-infinite system of polynomial inequalities of the form $$\begin{aligned} {{\mathbf {K}}}:=\{x\in {{\mathbb {R}}}^m\mid p(x,y)\ge 0,\quad \forall y\in S\subseteq {{\mathbb {R}}}^n\}, \end{aligned}$$K:={x∈Rm∣p(x,y)≥0,∀y∈S⊆Rn},where p(x, y) is a real polynomial in the variables x and the parameters y, the index set S is a basic semialgebraic set in $${{\mathbb {R}}}^n$$Rn, $$-p(x,y)$$-p(x,y) is convex in x for every $$y\in S$$y∈S. We propose a procedure to construct approximate semidefinite representations of $${{\mathbf {K}}}$$K. There are two indices to index these approximate semidefinite representations. As two indices increase, these semidefinite representation sets expand and contract, respectively, and can approximate $${{\mathbf {K}}}$$K as closely as possible under some assumptions. In some special cases, we can fix one of the two indices or both. Then, we consider the optimization problem of minimizing a convex polynomial over $${{\mathbf {K}}}$$K. We present an SDP relaxation method for this optimization problem by similar strategies used in constructing approximate semidefinite representations of $${{\mathbf {K}}}$$K. Under certain assumptions, some approximate minimizers of the optimization problem can also be obtained from the SDP relaxations. In some special cases, we show that the SDP relaxation for the optimization problem is exact and all minimizers can be extracted.

Keywords: Semi-infinite systems; Convex polynomials; Semidefinite representations; Semidefinite programming relaxations; Sum of squares; Polynomial optimization; 65K05; 90C22; 90C34 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-020-00168-0 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:coopap:v:75:y:2020:i:3:d:10.1007_s10589-020-00168-0

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-020-00168-0

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

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