Pages that link to "Item:Q2191285"
From MaRDI portal
The following pages link to Characterizing the solution set of convex optimization problems without convexity of constraints (Q2191285):
Displaying 10 items.
- A new approach to characterize the solution set of a pseudoconvex programming problem (Q390484) (← links)
- Characterizations of solution sets of cone-constrained convex programming problems (Q499701) (← links)
- Characterizations of the solution sets of generalized convex fuzzy optimization problem (Q2329994) (← links)
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials (Q2698576) (← links)
- A mean value theorem for tangentially convex functions (Q2699635) (← links)
- Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials (Q4985185) (← links)
- Optimality Conditions for Nonconvex Constrained Optimization Problems (Q5238081) (← links)
- Characterizations of the solution set for tangentially convex optimization problems (Q6043119) (← links)
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials (Q6064032) (← links)
- Optimality and duality for robust optimization problems involving intersection of closed sets (Q6608754) (← links)