Characterization of optimality in convex programming without a constraint qualification
- 1 December 1976
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 20 (4) , 417-437
- https://doi.org/10.1007/bf00933129
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Review of Constraint Qualifications in Finite-Dimensional SpacesSIAM Review, 1973
- Constraint Qualifications RevisitedManagement Science, 1972
- 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
- Duality in Nonlinear Programming: A Simplified Applications-Oriented DevelopmentSIAM Review, 1971
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach SpaceSIAM Journal on Control, 1969
- Asymptotic Lagrange Regularity for Pseudoconcave Programming with Weak Constraint QualificationOperations Research, 1968
- Seven Kinds of ConvexitySIAM Review, 1967
- Constraint qualifications in maximization problemsNaval Research Logistics Quarterly, 1961