Saddle-Point Optimality Criteria of Nonlinear Programming Problems over Cones without Differentiability
From MaRDI portal
Cited in
(7)- Characterization results of solutions in interval-valued optimization problems with mixed constraints
- On a modified optimal control problem with first-order PDE constraints and the associated saddle-point optimality criterion
- On interior and convexity conditions, development of dual problems and saddlepoint optimality criteria in abstract mathematical programming
- Modified regularity conditions for nonlinear programming problems over mixed cone domains
- Quadratic duality over convex cone domains
- On a sufficient optimality condition over convex feasible regions
- Saddle-point optimality criteria involving (p, b, d)-invexity and (p, b, d)-pseudoinvexity in interval-valued optimisation problems
This page was built for publication: Saddle-Point Optimality Criteria of Nonlinear Programming Problems over Cones without Differentiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5633189)