Multiplier rules and the separation of convex sets
From MaRDI portal
Publication:1169412
DOI10.1007/BF00933503zbMath0494.90084MaRDI QIDQ1169412
Publication date: 1983
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
generalized derivatives; necessary conditions; separation of convex sets; multiplier rules; Kuhn-Tucker theorem
90C48: Programming in abstract spaces
52A40: Inequalities and extremum problems involving convexity in convex geometry
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
Related Items
Mean value properties of nondifferentiation functions and their application in nonsmooth analysis, Univalence and degree for Lipschitz continuous maps, On the image of a constrained extremum problem and some applications to the existence of a minimum, Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems, Multiplier rules for weak pareto optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Univalence and degree for Lipschitz continuous maps
- Homeomorphisms and generalized derivatives
- Hadamard's theorem for locally Lipschitzian maps
- On the Caratheodory-John multiplier rule
- Necessary conditions without differentiability assumptions in unilateral control problems
- On the inverse function theorem
- Foundations of optimization
- Analysis and optimization of Lipschitz continuous mappings
- A minimal set-valued strong derivative for vector-valued Lipschitz functions
- Interior mapping theorem with set-valued derivatives
- Calcul sous-différentiel et optimisation
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Modern Multiplier Rules
- The Lagrange Multiplier Rule
- Generalized Gradients and Applications
- A Remark on the Direct Method of the Calculus of Variations
- On optimality conditions in nondifferentiable programming
- A New Approach to Lagrange Multipliers
- Refinements of necessary optimality conditions in nondifferentiable programming II
- GENERAL NECESSARY CONDITIONS FOR OPTIMIZATION PROBLEMS
- Extremum problems in the presence of restrictions