Implicit optimality criterion for convex SIP problem with box constrained index set

DOI10.1007/s11750-011-0189-5zbMath1262.90130OpenAlexW2036865528WikidataQ57677637 ScholiaQ57677637MaRDI QIDQ1939083

O. I. Kostyukova, Tatiana V. Tchemisova

Publication date: 26 February 2013

Published in: Top (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10773/6181

zbMATH Keywords

optimality conditionssemidefinite programming (SDP)constraint qualifications (CQ)immobile indexsemi-infinite programming (SIP)

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Semi-infinite programming (90C34)

Related Items (6)

Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets ⋮ Immobile indices and CQ-free optimality criteria for linear copositive programming problems ⋮ Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets ⋮ Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem ⋮ On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets ⋮ Optimality conditions for linear copositive programming problems with isolated immobile indices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regularizing the abstract convex program
• A simplified test for optimality
• First-order optimality conditions in generalized semi-infinite programming
• On optimality conditions for generalized semi-infinite programming problems
• Generalized semi-infinite programming: Theory and methods
• Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
• Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
• Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
• Semi-Infinite Programming: Theory, Methods, and Applications
• Some results about the facial geometry of convex semi-infinite systems
• Sufficient optimality conditions for convex semi-infinite programming
• Optimality conditions for convex semi-infinite programming problems
• Characterizations of optimality without constraint qualification for the abstract convex program
• 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
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Second-order optimality conditions in generalized semi-infinite programming
• Semi-infinite programming. Recent advances

This page was built for publication: Implicit optimality criterion for convex SIP problem with box constrained index set