Implicit optimality criterion for convex SIP problem with box constrained index set
type: Item
instance of: scholarly article
title: Implicit optimality criterion for convex SIP problem with box constrained index set
zbMATH Open document ID: 1262.90130
author: O. I. Kostyukova
author: Tatiana V. Tchemisova
published in: Top
publication date: 2013-02-26T00:00:00Z
full work available at URL: http://hdl.handle.net/10773/6181
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C34
zbMATH DE Number: 6139266
zbMATH Keywords: semi-infinite programming (SIP)
zbMATH Keywords: semidefinite programming (SDP)
zbMATH Keywords: constraint qualifications (CQ)
zbMATH Keywords: immobile index
zbMATH Keywords: optimality conditions
Wikidata QID: Q57677637
MaRDI profile type: Publication
OpenAlex ID: W2036865528
cites work: A simplified test for optimality
cites work: Optimality conditions for convex semi-infinite programming problems
cites work: Q4503250
cites work: Regularizing the abstract convex program
cites work: Characterizations of optimality without constraint qualification for the abstract convex program
cites work: On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
cites work: Some results about the facial geometry of convex semi-infinite systems
cites work: Semi-infinite programming. Recent advances
cites work: Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
cites work: Q4161092
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: Second order optimality conditions for generalized semi-infinite programming problems
cites work: New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
cites work: On sufficient conditions for local optimality in semi-infinite programming
cites work: Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
cites work: Sufficient optimality conditions for convex semi-infinite programming
cites work: Q3542466
cites work: Constraint qualifications for semi-infinite systems of convex inequalities
cites work: First-order optimality conditions in generalized semi-infinite programming
cites work: Second-order optimality conditions in generalized semi-infinite programming
cites work: On optimality conditions for generalized semi-infinite programming problems
cites work: Generalized semi-infinite programming: Theory and methods
cites work: Q4184619
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
DOI: 10.1007/S11750-011-0189-5
description: scientific article; zbMATH DE number 6139266