scientific article; zbMATH DE number 4051350

MaRDI QIDQ3787791zbMATH OpenFDO

Authors S. V. Pashko

Publication date 1987

zbMATH Keywords

strong convexity

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15)

Recommendations

• On complexity of stochastic programming problems
• Computational complexity of stochastic programming problems
• scientific article; zbMATH DE number 3956819
• Strong convexity in stochastic programs with complete recourse
• Tight Bounds for Stochastic Convex Programs
• scientific article; zbMATH DE number 4031400
• Approximation of stochastic programming problems
• Convex approximations in stochastic programming by semidefinite programming
• scientific article; zbMATH DE number 1328978
• scientific article; zbMATH DE number 1031417

Cited in

(7)

• Strong scheme for a stochastic Goursat problem.
• Stochastic separated continuous conic programming: strong duality and a solution method
• Strong convexity in risk-averse stochastic programs with complete recourse
• On the information-based complexity of stochastic programming
• The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
• Improving constants of strong convexity in linear stochastic programming
• scientific article; zbMATH DE number 3858861 (Why is no real title available?)

This page was built for publication:

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