A general extremum principle for optimization problems

DOI10.1016/0362-546X(79)90056-7zbMath0426.90078OpenAlexW2025709615MaRDI QIDQ3863710

Mieczyslaw Altman

Publication date: 1979

Published in: Nonlinear Analysis: Theory, Methods & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0362-546x(79)90056-7

zbMATH Keywords

optimizationLagrange multipliersequality constraintsconvex functionsinequality constraintsfeasible directionsinfinite dimensional spacesMazur's separation theorem

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods involving duality (49M29) Programming in abstract spaces (90C48)

Related Items (1)

Local convex analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Eine Verallgemeinerung des Satzes von DUBOVICKIJ-MILJUTIN
• GENERAL NECESSARY CONDITIONS FOR OPTIMIZATION PROBLEMS
• A general separation theorem for mappings, saddle-points duality and conjugate functions
• A general maximum principle for optimization problems

This page was built for publication: A general extremum principle for optimization problems