@article{Kostyukova_Tchemisova_2020, title={CQ-free optimality conditions and strong dual formulations for a special conic optimization problem}, volume={8}, url={http://iapress.org/index.php/soic/article/view/915}, DOI={10.19139/soic-2310-5070-915}, abstractNote={<p>In this paper, we consider a special class of conic optimization problems, consisting of set-semidefinite<br>(or K-semidefinite) programming problems, where the set K is a polyhedral convex cone.</p> <p>For these problems, we introduce the concept of immobile indices and study the properties of the set of normalized immobile indices and the feasible set. This study provides the main result of the paper, which is to formulate and prove the new first-order optimality conditions in the form of a criterion. The optimality conditions are explicit and do not use any constraint qualifications. For the case of a linear cost function, we reformulate the K-semidefinite problem in a regularized form and construct its dual. We show that the pair of the primal and dual regularized problems satisfies the strong duality relation which means that the duality gap is vanishing.</p>}, number={3}, journal={Statistics, Optimization & Information Computing}, author={Kostyukova, Olga and Tchemisova, Tatiana V.}, year={2020}, month={Jun.}, pages={668-683} }