Paper
21 July 2024 A full description of the isolated calmness of semidefinite programming problem
Songqi Gao, Ziran Yin
Author Affiliations +
Proceedings Volume 13219, Fourth International Conference on Applied Mathematics, Modelling, and Intelligent Computing (CAMMIC 2024); 132192U (2024) https://doi.org/10.1117/12.3035116
Event: 4th International Conference on Applied Mathematics, Modelling and Intelligent Computing (CAMMIC 2024), 2024, Kaifeng, China
Abstract
The objective of this work is to analyze the isolated calmness of the mapping of semidefinite programming problem Karush-Kuhn-Tucker solution. We give the equivalence between the dual/primal strict Robinson constraint qualification and the primal/dual second order sufficient condition of the semidefinite programming. Based on the results, we get the equivalent conditions of the isolated calmness of the Karush-Kuhn-Tucker solution mapping.
(2024) Published by SPIE. Downloading of the abstract is permitted for personal use only.
Songqi Gao and Ziran Yin "A full description of the isolated calmness of semidefinite programming problem", Proc. SPIE 13219, Fourth International Conference on Applied Mathematics, Modelling, and Intelligent Computing (CAMMIC 2024), 132192U (21 July 2024); https://doi.org/10.1117/12.3035116
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer programming

Matrices

Sun

Analytical research

Mathematical optimization

Quantum computing

Binary data

Back to Top