A general extremum principle for optimization problems

DOI10.1016/0362-546X(79)90056-7MaRDI QIDQ3863710zbMATH OpenOpenAlexFDO

Authors 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

convex functionsequality constraintsfeasible directionsinequality constraintsinfinite dimensional spacesLagrange multipliersMazur's separation theoremoptimization

Mathematics Subject Classification ID

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

Cites work

• A general maximum principle for optimization problems
• A general separation theorem for mappings, saddle-points duality and conjugate functions
• Eine Verallgemeinerung des Satzes von DUBOVICKIJ-MILJUTIN
• GENERAL NECESSARY CONDITIONS FOR OPTIMIZATION PROBLEMS
• scientific article; zbMATH DE number 3167340 (Why is no real title available?)
• scientific article; zbMATH DE number 3068775 (Why is no real title available?)

Cited in

(1)

• Local convex analysis

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3863710)