Optimality criterion for semi-infinite programming problems with faithfully convex constraint functions

MaRDI QIDQ5270400zbMATH OpenFDO

Authors O. I. Kostyukova, M. V. Kulagina

Publication date 23 June 2017

Full work available at URL http://mathnet.ru/eng/pfmt487

zbMATH Keywords

convex programmingfaithfully convex functionimmobile indeximmobility ordersemi-infinite programming

Mathematics Subject Classification ID

Convex programming (90C25) 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
• scientific article; zbMATH DE number 27253
• Study of a special nonlinear problem arising in convex semi-infinite programming
• First-order optimality conditions for convex semi-infinite min-max programming with noncompact sets

Cited in

(6)

• Sufficient optimality criteria for optimization problem involving pseudoconvex interval objective function
• Sufficient optimality conditions for convex semi-infinite programming
• scientific article; zbMATH DE number 2143162 (Why is no real title available?)
• scientific article; zbMATH DE number 2158983 (Why is no real title available?)
• New Farkas-type constraint qualifications in convex infinite programming
• Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices

This page was built for publication: Optimality criterion for semi-infinite programming problems with faithfully convex constraint functions

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