Convex analysis and extremum conditions in the theory of extremum problems

DOI10.1023/A:1020300308188MaRDI QIDQ1406324zbMATH OpenOpenAlexFDO

Authors V. M. Tikhomirov

Publication date 9 September 2003

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1020300308188

zbMATH Keywords

closureconvexitydualityepigraph of a functionLagrange principleseparability

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Cited in

(3)

• Bounding, theorems, extremum principles and convexity
• Applications of convex analysis and comparison functionals to extremum principles
• scientific article; zbMATH DE number 2212089 (Why is no real title available?)

This page was built for publication: Convex analysis and extremum conditions in the theory of extremum problems

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