Necessary optimality criteria in mathematical programming in normed linear spaces
From MaRDI portal
Publication:2553910
Cites work
- A general maximum principle for optimization problems
- A general theory of extremals
- A General Theory of Minimum-Fuel Space Trajectories
- A generalization of Lagrange multipliers
- A satisfactory treatment of equality and operator constraints in the Dubovitskii-Milyutin optimization formalism
- GENERAL NECESSARY CONDITIONS FOR OPTIMIZATION PROBLEMS
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3291743 (Why is no real title available?)
- scientific article; zbMATH DE number 3354821 (Why is no real title available?)
- scientific article; zbMATH DE number 3366706 (Why is no real title available?)
- Necessary Conditions for Optimization Problems with Operatorial Constraints
- Necessary optimality criteria in mathematical programming in the presence of differentiability
- On Differentiation in Normed Vector Spaces
- On the cones of tangents with applications to mathematical programming
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
Cited in
(7)- Perturbation theory for abstract optimization problems
- Subdifferentials of compactly Lipschitzian vector-valued functions
- Optimal fiscal policy in a stochastic growth model
- A saddle-point criterion for convex problems with infinite-dimensional equality constraints
- On the existence and nonexistence of Lagrange multipliers in Banach spaces
- On the cones of tangents with applications to mathematical programming
- Local convex analysis
This page was built for publication: Necessary optimality criteria in mathematical programming in normed linear spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553910)
