On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets
From MaRDI portal
Publication:5413872
DOI10.1080/02331934.2013.853062zbMath1321.90141WikidataQ57677632 ScholiaQ57677632MaRDI QIDQ5413872
Tatiana V. Tchemisova, O. I. Kostyukova
Publication date: 2 May 2014
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2013.853062
semidefinite programming; optimality conditions; semi-infinite programming; constraint qualification; immobile index; immobility order
Related Items
Optimality conditions for linear copositive programming problems with isolated immobile indices, Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets, Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem, Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets, On strong duality in linear copositive programming, Immobile indices and CQ-free optimality criteria for linear copositive programming problems
Cites Work
- Optimality criteria without constraint qualifications for linear semidefinite problems
- Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
- On optimality conditions for generalized semi-infinite programming problems
- Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
- Implicit optimality criterion for convex SIP problem with box constrained index set
- Semi-Infinite Programming: Theory, Methods, and Applications
- Sufficient optimality conditions for convex semi-infinite programming
- Second-Order Derivatives of Extremal-Value Functions and Optimality Conditions for Semi-Infinite Programs
- Optimality conditions for convex semi-infinite programming problems
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- On sufficient conditions for local optimality in semi-infinite programming
- Second order optimality conditions for generalized semi-infinite programming problems
- Algorithm for discovering the set of all the solutions of a linear programming problem
- Second-order optimality conditions in generalized semi-infinite programming
