Optimality conditions and constraint qualifications in Banach space
From MaRDI portal
Publication:1843379
DOI10.1007/BF00935506zbMath0281.90066MaRDI QIDQ1843379
Publication date: 1975
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Convex programming (90C25) Nonlinear programming (90C30) Optimality conditions for problems in abstract spaces (49K27)
Related Items
When the Karush-Kuhn-Tucker theorem fails: constraint qualifications and higher-order optimality conditions for degenerate optimization problems, First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition, Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems, New Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT Conditions, Unnamed Item, Why (some) abnormal problems are ``normal, An elementary proof of the Karush–Kuhn–Tucker theorem in normed linear spaces for problems with a finite number of inequality constraints, Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under \((\varPhi, \rho)\)-invexity, Geometry of optimality conditions and constraint qualifications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- The Kuhn-Tucker conditions in Banach space with an application to control theory
- Optimization theory in linear spaces. III: Mathematical programming in partially ordered Banach spaces
- Constraint qualifications in maximization problems
- Constrained Minimization Problems in Finite-Dimensional Spaces
- GENERAL NECESSARY CONDITIONS FOR OPTIMIZATION PROBLEMS
- An Abstract Variational Theory with Applications to a Broad Class of Optimization Problems. I. General Theory
- Nonlinear Programming in Banach Space
- An Infinite-Horizon Discrete-Time Quadratic Program as Applied to a Monopoly Problem
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- A Necessary and Sufficient Qualification for Constrained Optimization
- Capital Accumulation and Efficient Allocation of Resources