Explicit optimality conditions for convex semi-infinite programming problems
From MaRDI portal
Recommendations
- Study of a special nonlinear problem arising in convex semi-infinite programming
- Implicit optimality criterion for convex SIP problem with box constrained index set
- Sufficient optimality conditions for convex semi-infinite programming
- On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets
- Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
Cited in
(12)- Optimality conditions for semi-preinvex programming
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
- A refined theorem concerning the conditioning of semidefinite programs
- Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems
- Sufficient optimality conditions for convex semi-infinite programming
- scientific article; zbMATH DE number 27253 (Why is no real title available?)
- scientific article; zbMATH DE number 2143162 (Why is no real title available?)
- Optimality conditions for nonlinear infinite programming problems
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets
- Empirical Properties of Optima in Free Semidefinite Programs
- Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
This page was built for publication: Explicit optimality conditions for convex semi-infinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3161334)
