Duality and optimality for convex extremal problems described by discrete inclusions

DOI10.1080/02331938008842627zbMATH Open0514.90071OpenAlexW2008194071MaRDI QIDQ3661325FDOQ3661325

Ştefan-Gicu Cruceanu

Publication date: 1980

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938008842627

zbMATH Keywords

optimality conditionsHamiltonian approachdiscrete inclusionsconjugate transformation methodconvex (multi-valued) mappingsymmetric duality schemetheory of convex processes

Mathematics Subject Classification ID

Convex programming (90C25) Methods of successive quadratic programming type (90C55) Sensitivity, stability, parametric optimization (90C31) Duality theory (optimization) (49N15)

Cited In (2)

• Convex and convex-like optimization over a range inclusion problem and first applications
• Conjugate duality and the control of linear discrete systems

This page was built for publication: Duality and optimality for convex extremal problems described by discrete inclusions

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