Characterizations of optimality without constraint qualification for the abstract convex program
- 1 January 1982
- book chapter
- Published by Springer Nature
- p. 77-100
- https://doi.org/10.1007/bfb0120983
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Complete characterization of optimality for convex programming in banach spaces †Applicable Analysis, 1980
- Characterizations of optimality in convex programming: the nondifferentiable caseApplicable Analysis, 1979
- A simplified test for optimalityJournal of Optimization Theory and Applications, 1978
- Proper Efficient Points for Maximizations with Respect to ConesSIAM Journal on Control and Optimization, 1977
- Characterization of optimality in convex programming without a constraint qualificationJournal of Optimization Theory and Applications, 1976
- Nonlinear programming without differentiability in banach spaces: necessary and sufficient constraint qualificationApplicable Analysis, 1976
- Normed Linear SpacesPublished by Springer Nature ,1973
- Geometry of optimality conditions and constraint qualificationsMathematical Programming, 1972
- Lectures on Mathematical Theory of Extremum ProblemsPublished by Springer Nature ,1972
- A Necessary and Sufficient Qualification for Constrained OptimizationSIAM Journal on Applied Mathematics, 1971