Convex stochastic optimization for random fields on graphs: A method of constructing Lagrange multipliers

DOI10.1007/S001860100148zbMATH Open1031.90018OpenAlexW2141359959MaRDI QIDQ1397009FDOQ1397009

Authors: Igor V. Evstigneev, Michael Taksar 

Publication date: 16 July 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860100148

Recommendations

• scientific article; zbMATH DE number 1779292
• The infinite dimensional Lagrange multiplier rule for convex optimization problems
• Duality relations and optimality conditions in linear stochastic programming
• Optimality conditions for convex stochastic optimization problems in Banach spaces with almost sure state constraints
• Controlled random sequences: methods of convex analysis and problems with functional constraints

zbMATH Keywords

stochastic optimizationLagrange multiplier

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Stochastic programming (90C15)

Cited In (1)

• Convex relaxation for IMSE optimal design in random-field models

This page was built for publication: Convex stochastic optimization for random fields on graphs: A method of constructing Lagrange multipliers

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