Please use this identifier to cite or link to this item:
|Title:||Implicit optimality criterion for convex SIP problem with box constrained index set|
|Author:||Kostyukova, O. I.|
Tchemisova, T. V.
|Keywords:||Semi-Infinite Programming (SIP)|
Semi-Definite Programming (SDP)
Constraint qualiﬁcations (CQ)
|Abstract:||We consider a convex problem of Semi-Infinite Programming (SIP) with multidimensional index set. In study of this problem we apply the approach suggested in  for convex SIP problems with one-dimensional index sets and based on the notions of immobile indices and their immobility orders. For the problem under consideration we formulate optimality conditions that are explicit and have the form of criterion. We compare this criterion with other known optimality conditions for SIP and show its efficiency in the convex case.|
|Appears in Collections:||CIDMA - Artigos|
Files in This Item:
|SIP-TOP - Revised-2011.pdf||Documento aceite a publicação||184.61 kB||Adobe PDF||View/Open|
|TOP 2012.pdf||875.06 kB||Adobe PDF||Request a copy|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.