Mathematics of Operations Research · 1979 · 399 citations · 10 references
Natural SciencesMathematicsCost-minimization AnalysisDesign OptimizationOptimizationConstrained OptimizationConvex AnalysisConvex OptimizationGradient-based OptimizationNonlinear ProgrammingOptimization TheoryConstraint Optimization ProblemsConstraintsConvex ConesConvexityConvexity ConditionsMathematical Programming ModelsNormal ConesOptimality Conditions
This study is devoted to constrained optimization problems in Banach spaces. We present different properties of tangent cones associated with an arbitrary subset of a Banach space and establish correlations with some of the existing results. In absence of both differentiability and convexity assumptions on the functions involved in the optimization problem, the consideration of these tangent cones and their polars leads us to introduce new concepts in nondifferentiable programming. Necessary optimality conditions are first developed in a general abstract form; then these conditions are made more precise in the presence of equality constraints by introducing the concept of normal subcone.
10
Generalized gradients and applications
Frank H. Clarke · Transactions of the American Mathematical Society · 1975 · 1.2K citations
A New Approach to Lagrange Multipliers
Frank H. Clarke · Mathematics of Operations Research · 1976 · 502 citations
On the inverse function theorem
Francis Clarke · Pacific Journal of Mathematics · 1976 · 317 citations · Full text
Generalized gradients of Lipschitz functionals
Frank H. Clarke · Advances in Mathematics · 1981 · 185 citations