Optimality Conditions for Convex Semi-infinite Programming Problems with Finitely Representable Compact Index Sets

In the present paper, we analyze a class of convex semi-infinite programming problems with arbitrary index sets defined by a finite number of nonlinear inequalities. The analysis is carried out by employing the constructive approach, which, in turn, relies on the notions of immobile indices and thei...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of optimization theory and applications Ročník 175; číslo 1; s. 76 - 103
Hlavní autoři:	Kostyukova, Olga, Tchemisova, Tatiana
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.10.2017 Springer Nature B.V
Témata:	Applications of Mathematics Calculus of Variations and Optimal Control; Optimization Economic models Engineering Inequalities Mathematics Mathematics and Statistics Nonlinear analysis Nonlinear programming Operations Research/Decision Theory Optimization Proving Theory of Computation Optimality conditions Convex set 90C30 90C25 Immobile index 90C34 Finitely representable set Constraint qualifications (CQ) Convex programming Nonlinear programming (NLP) Semi-infinite programming (SIP)
ISSN:	0022-3239, 1573-2878
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!