Randomized Algorithms for Semi-Infinite Programming Problems

DOI10.1007/1-84628-095-8_9MaRDI QIDQ5201302zbMATH OpenOpenAlexFDO

Authors Vladislav B. Tadić, Sean P. Meyn, Roberto Tempo

Publication date 18 April 2006

Published in Probabilistic and Randomized Methods for Design under Uncertainty (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/1-84628-095-8_9

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Recommendations

• Stochastic algorithm for solving convex semi-infinite problem with equality and inequality constraints
• scientific article; zbMATH DE number 4204117
• Application of the Monte-Carlo method to stochastic linear programming
• Solving a class of convex stochastic programs via Monte Carlo simulation
• Stochastic algorithm for solving convex semi-infinite programming problems with equality and inequality constraints

Cited in

(6)

• Random algorithms for solving convex inequalities
• scientific article; zbMATH DE number 5999718 (Why is no real title available?)
• Solving NP-hard semirandom graph problems in polynomial expected time
• The randomized complexity of initial value problems
• Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
• scientific article; zbMATH DE number 3961382 (Why is no real title available?)

This page was built for publication: Randomized Algorithms for Semi-Infinite Programming Problems

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