12 results
Search Results
2. Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems.
3. On duality gap with polynomial multipliers for polynomial optimization problems.
4. On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty.
5. Optimality conditions for a multiobjective bilevel optimization problem involving set valued constraints.
6. Optimality conditions for efficient solutions of nonconvex constrained multiobjective optimization problems via image space analysis.
7. The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems.
8. A generalization of multiplier rules for infinite-dimensional optimization problems.
9. Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials.
10. An introduction to non-smooth convex analysis via multiplicative derivative.
11. On the multiplier rules.
12. Weak subdifferential/superdifferential, weak exhausters and optimality conditions.
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.