### Abstract

Language | English |
---|---|

Pages | 207-229 |

Journal | Mathematical Programming |

Issue number | 147 |

DOIs | |

Publication status | Published - 2014 |

### Fingerprint

### Cite this

*Mathematical Programming*, (147), 207-229. https://doi.org/10.1007/s10107-013-0718-0

}

*Mathematical Programming*, no. 147, pp. 207-229. https://doi.org/10.1007/s10107-013-0718-0

**A simple randomised algorithm for convex optimisation - Application to two-stage stochastic programming.** / Dyer, M.; Kannan, R.; Stougie, L.

Research output: Contribution to Journal › Article › Academic › peer-review

TY - JOUR

T1 - A simple randomised algorithm for convex optimisation - Application to two-stage stochastic programming.

AU - Dyer, M.

AU - Kannan, R.

AU - Stougie, L.

PY - 2014

Y1 - 2014

N2 - We consider maximising a concave function over a convex set by a simple randomised algorithm. The strength of the algorithm is that it requires only approximate function evaluations for the concave function and a weak membership oracle for the convex set. Under smoothness conditions on the function and the feasible set, we show that our algorithm computes a near-optimal point in a number of operations which is bounded by a polynomial function of all relevant input parameters and the reciprocal of the desired precision, with high probability. As an application to which the features of our algorithm are particularly useful we study two-stage stochastic programming problems. These problems have the property that evaluation of the objective function is #P-hard under appropriate assumptions on the models. Therefore, as a tool within our randomised algorithm, we devise a fully polynomial randomised approximation scheme for these function evaluations, under appropriate assumptions on the models. Moreover, we deal with smoothing the feasible set, which in two-stage stochastic programming is a polyhedron.

AB - We consider maximising a concave function over a convex set by a simple randomised algorithm. The strength of the algorithm is that it requires only approximate function evaluations for the concave function and a weak membership oracle for the convex set. Under smoothness conditions on the function and the feasible set, we show that our algorithm computes a near-optimal point in a number of operations which is bounded by a polynomial function of all relevant input parameters and the reciprocal of the desired precision, with high probability. As an application to which the features of our algorithm are particularly useful we study two-stage stochastic programming problems. These problems have the property that evaluation of the objective function is #P-hard under appropriate assumptions on the models. Therefore, as a tool within our randomised algorithm, we devise a fully polynomial randomised approximation scheme for these function evaluations, under appropriate assumptions on the models. Moreover, we deal with smoothing the feasible set, which in two-stage stochastic programming is a polyhedron.

U2 - 10.1007/s10107-013-0718-0

DO - 10.1007/s10107-013-0718-0

M3 - Article

SP - 207

EP - 229

JO - Mathematical Programming

T2 - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 147

ER -