Please use this identifier to cite or link to this item:
|Title:||Optimality criteria without constraint qualications for linear semidenite problems|
|Author:||Kostyukova, O. I.|
Tchemisova, T. V.
|Keywords:||Semi-Infinite Programming (SIP)|
Semidefinite Programming (SDP)
Subspace of immobile indices
Constraint Qualiﬁcation (CQ)
|Abstract:||We consider two closely related optimization problems: a problem of convex Semi- Infinite Programming with multidimensional index set and a linear problem of Semidefinite Programming. In study of these problems we apply the approach suggested in our recent paper  and based on the notions of immobile indices and their immobility orders. For the linear semidefinite problem, we define the subspace of immobile indices and formulate the first order optimality conditions in terms of a basic matrix of this subspace. These conditions are explicit, do not use constraint qualifications, and have the form of criterion. An algorithm determining a basis of the subspace of immobile indices in a finite number of steps is suggested. The optimality conditions obtained are compared with other known optimality conditions.|
|Appears in Collections:||CIDMA - Artigos|
Files in This Item:
|Kost.-Tchem.--revised.pdf||JMS-2012||142.12 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.