Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems

La Huang (), Danyang Liu () and Yaping Fang ()
Additional contact information
La Huang: Sichuan University
Danyang Liu: Sichuan University
Yaping Fang: Sichuan University

Annals of Operations Research, 2023, vol. 320, issue 1, No 3, 33-59

Abstract: Abstract This paper is concerned with a convex polynomial optimization problem in the face of data uncertainty both in the objective function and the constraints. Using the minimax robust optimization approach, we formulate the robust counterpart of the uncertain convex polynomial optimization problem. First, we present dual characterizations of positivity and nonnegativity of the objective function of a convex polynomial optimization problem with data uncertainty. Next, based on the dual characterizations, we derive optimality conditions for the robust convex polynomial optimization problem. Then, we consider a semidefinite programming (SDP) relaxation of the robust convex polynomial optimization problem, and show the convergence of an SDP hierarchy by means of optimality conditions derived for an equivalent reformulation of the robust problem. Finally, under an additional assumption that the Hessian matrix of the Lagrange function of the uncertain convex polynomial optimization problem is positive definite at some saddle point, we prove the finite convergence of an SDP hierarchy of the robust convex polynomial optimization problem.

Keywords: Convex polynomial; Robust optimization; Optimality conditions; SDP relaxations; Convergence; 90C17; 90C23; 90C46; 90C34; 90C25 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-022-05103-6 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:annopr:v:320:y:2023:i:1:d:10.1007_s10479-022-05103-6

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

DOI: 10.1007/s10479-022-05103-6

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().