Saddle-Point Optimality Criteria of Nonlinear Programming Problems over Cones without Differentiability

DOI10.1137/0120068zbMath0226.49024OpenAlexW2024333659MaRDI QIDQ5633189

Herbert T. David, Vince A. Sposito

Publication date: 1971

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0120068

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37)

Related Items (7)

Characterization results of solutions in interval-valued optimization problems with mixed constraints ⋮ Saddle-point optimality criteria involving (p, b, d)-invexity and (p, b, d)-pseudoinvexity in interval-valued optimisation problems ⋮ 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 ⋮ On a modified optimal control problem with first-order PDE constraints and the associated saddle-point optimality criterion

This page was built for publication: Saddle-Point Optimality Criteria of Nonlinear Programming Problems over Cones without Differentiability