Lossless convexification and duality
Journal of the Franklin Institute(2024)
Abstract
The main goal of this paper is to investigate the strong duality of non-convex semidefinite programming problems (SDPs). In the optimization community, it is well-known that a convex optimization problem satisfies strong duality if Slater’s condition holds. However, this result cannot be directly generalized to non-convex problems. In this paper, we prove that a class of non-convex SDPs with special structures satisfies strong duality under Slater’s condition. Such a class of SDPs arises in SDP-based control analysis and design approaches. Throughout the paper, several examples are given to support the proposed results. We expect that the proposed analysis can potentially deepen our understanding of non-convex SDPs arising in the control community and promote their analysis based on KKT conditions.
MoreTranslated text
Key words
Semidefinite programming,Linear matrix inequality,Control design,Duality,Lagrangian function,Optimization
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined