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

DOI10.1007/S11750-011-0189-5MaRDI QIDQ1939083zbMATH OpenOpenAlexWikidataFDO

Authors 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

constraint qualifications (CQ)immobile indexoptimality conditionssemi-infinite programming (SIP)semidefinite programming (SDP)

Mathematics Subject Classification ID

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

Recommendations

• Sufficient optimality conditions for convex semi-infinite programming
• Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
• Study of a special nonlinear problem arising in convex semi-infinite programming
• On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets
• Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets

Cites work

• A simplified test for optimality
• Characterizations of optimality without constraint qualification for the abstract convex program
• Constraint qualifications for semi-infinite systems of convex inequalities
• First-order optimality conditions in generalized semi-infinite programming
• Generalized semi-infinite programming: Theory and methods
• Handbook of semidefinite programming. Theory, algorithms, and applications
• scientific article; zbMATH DE number 3593326 (Why is no real title available?)
• scientific article; zbMATH DE number 3621462 (Why is no real title available?)
• scientific article; zbMATH DE number 1502618 (Why is no real title available?)
• Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• On optimality conditions for generalized semi-infinite programming problems
• On sufficient conditions for local optimality in semi-infinite programming
• On the algorithm of determination of immobile indices for convex SIP problems
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• Optimality conditions for convex semi-infinite programming problems
• Regularizing the abstract convex program
• Second order optimality conditions for generalized semi-infinite programming problems
• Second-order optimality conditions in generalized semi-infinite programming
• Semi-infinite programming. Recent advances
• Semi-Infinite Programming: Theory, Methods, and Applications
• Some results about the facial geometry of convex semi-infinite systems
• Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
• Sufficient optimality conditions for convex semi-infinite programming

Cited in

(8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1939083)