Repositório Institucional da Universidade de Aveiro > CIDMA - Centro de Investigação e Desenvolvimento em Matemática e Aplicações > CIDMA - Capítulo de livro >
 Subspace of immobile indices in study of convex semidefinite problems
Please use this identifier to cite or link to this item http://hdl.handle.net/10773/6220

title: Subspace of immobile indices in study of convex semidefinite problems
authors: Kostyukova, O. I.
Tchemisova, T. V.
issue date: 10-Feb-2012
publisher: United Institute of Informatics Problems of the National Academy of Sciences of Belarus
abstract: We are concerned with convex problems of infinite optimization, namely a linear problem of Semidefinite Programming (SDP). For this problem, we introduce a subspace of immobile indices, prove that in the case when the Slater condition is not satisfied, this subspace is not vanishing, and suggest an algorithm that constructs a base of this subspace. We show that the subspace of immobile indices is an important characteristic of the feasible set that can be successfully used for formulation of efficient optimality conditions. These conditions do not use any constraint qualifications and therefore can be applied to wide classes of SDP problems. 1. Introduction. In the
URI: http://hdl.handle.net/10773/6220
appears in collectionsCIDMA - Capítulo de livro

files in this item

file description sizeformat
Tanaev-submitted-2010.pdf137.3 kBAdobe PDFview/open
Restrict Access. You can Request a copy!

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! RCAAP OpenAIRE DeGóis
ria-repositorio@ua.pt - Copyright ©   Universidade de Aveiro - RIA Statistics - Powered by MIT's DSpace software, Version 1.6.2