DSpace
 
  Repositório Institucional da Universidade de Aveiro > CIDMA - Centro de Investigação e Desenvolvimento em Matemática e Aplicações > CIDMA - Artigos >
 Implicit optimality criterion for convex SIP problem with box constrained index set
Please use this identifier to cite or link to this item http://hdl.handle.net/10773/6181

title: Implicit optimality criterion for convex SIP problem with box constrained index set
authors: 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.
URI: http://hdl.handle.net/10773/6181
ISSN: 1134-5764
publisher version/DOI: http://dx.doi.org/10.1007/s11750-011-0189-5
source: TOP
appears in collectionsCIDMA - Artigos

files in this item

file description sizeformat
TOP 2012.pdf875.06 kBAdobe PDFview/open
Restrict Access. You can Request a copy!
SIP-TOP - Revised-2011.pdfDocumento aceite a publicação184.61 kBAdobe PDFview/open
statistics

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