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 qualifications (CQ)
Immobile index
Optimality conditions
Issue Date: Jul-2012
Publisher: Springer Verlag
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 [20] 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.
Peer review: yes
DOI: 10.1007/s11750-011-0189-5
ISSN: 1134-5764
Appears in Collections:CIDMA - Artigos

Files in This Item:
File Description SizeFormat 
SIP-TOP - Revised-2011.pdfDocumento aceite a publicação184.61 kBAdobe PDFView/Open
TOP 2012.pdf875.06 kBAdobe PDFrestrictedAccess

Formato BibTex MendeleyEndnote Degois 

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