Multiplier rules and the separation of convex sets

DOI10.1007/BF00933503zbMath0494.90084MaRDI QIDQ1169412

Bruce Pourciau

Publication date: 1983

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

generalized derivativesnecessary conditionsseparation of convex setsmultiplier rulesKuhn-Tucker theorem

Mathematics Subject Classification ID

Programming in abstract spaces (90C48) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (6)

Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems ⋮ On the image of a constrained extremum problem and some applications to the existence of a minimum ⋮ Multiplier rules for weak pareto optimization problems ⋮ Univalence and degree for Lipschitz continuous maps ⋮ Pooled testing for quarantine decisions ⋮ Mean value properties of nondifferentiation functions and their application in nonsmooth analysis

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Multiplier rules and the separation of convex sets