Pages that link to "Item:Q1226443"
From MaRDI portal
The following pages link to Characterization of optimality in convex programming without a constraint qualification (Q1226443):
Displayed 18 items.
- Second-order and related extremality conditions in nonlinear programming (Q754769) (← links)
- A note on multiple optimality conditions for programs with convex inequality constraints (Q916574) (← links)
- On efficient sets in vector maximum problems - A brief survey (Q1068004) (← links)
- Regularizing the abstract convex program (Q1156085) (← links)
- Method of reduction in convex programming (Q1169402) (← links)
- A simplified test for optimality (Q1236066) (← links)
- Calculating the cone of directions of constancy (Q1240157) (← links)
- Projection and restriction methods in geometric programming and related problems (Q1243242) (← links)
- Characterizations of optimality in convex programming: the nondifferentiable case (Q3048158) (← links)
- Primal and dual optimality criteria in convex programming (Q3208441) (← links)
- Generalized convexity in nondifferentiable programming (Q3338844) (← links)
- (Q3342228) (← links)
- Geometry of optimality conditions and constraint qualifications: The convex case (Q3877415) (← links)
- Complete characterization of optimality for convex programming in banach spaces<sup>†</sup> (Q3890447) (← links)
- On optimality in abstract convex programming (Q3968766) (← links)
- On A characterization of optimality in convex programming (Q4123086) (← links)
- Characterizations of optimality in convex programming: the nondifferentiable case (Q4196253) (← links)
- A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential (Q4293262) (← links)