A saddle-point criterion for convex problems with infinite-dimensional equality constraints

DOI10.1007/BF00933918zbMath0292.49010OpenAlexW1964742045MaRDI QIDQ1211716

Jamie J. Goode, Mokhtar S. Bazaraa

Publication date: 1975

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00933918

Mathematics Subject Classification ID

Convex programming (90C25) Controllability (93B05) Methods of successive quadratic programming type (90C55) Optimality conditions for problems in abstract spaces (49K27)

Related Items

Higher order necessary conditions in abstract mathematical programming

Cites Work

• A general theory of extremals
• A satisfactory treatment of equality and operator constraints in the Dubovitskii-Milyutin optimization formalism
• Necessary optimality criteria in mathematical programming in normed linear spaces
• Necessary Conditions for Optimization Problems with Operatorial Constraints
• A General Theory of Minimum-Fuel Space Trajectories
• On Differentiation in Normed Vector Spaces
• GENERAL NECESSARY CONDITIONS FOR OPTIMIZATION PROBLEMS
• Points of Minimum Or Maximum Norm on Smooth Surfaces in Banach Spaces
• A generalization of Lagrange multipliers
• A Generalized Lagrange Multiplier Rule for Equality Constraints in Normed Linear Spaces
• A general maximum principle for optimization problems
• State Constraints in Convex Control Problems of Bolza
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item