Gaining traction: on the convergence of an inner approximation scheme for probability maximization
From MaRDI portal
Publication:2045616
DOI10.1007/s10100-020-00697-3OpenAlexW3043729742MaRDI QIDQ2045616
Publication date: 13 August 2021
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-020-00697-3
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dual methods for probabilistic optimization problems.
- Linear and nonlinear programming.
- Conjugation and second-order properties of convex functions
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
- Subdifferential characterization of probability functions under Gaussian distribution
- Regularization methods for optimization problems with probabilistic constraints
- Level bundle methods for oracles with on-demand accuracy
- Smoothed analysis of algorithms
- Generalized Bundle Methods
- A Practical Geometrically Convergent Cutting Plane Algorithm
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- Concavity and efficient points of discrete distributions in probabilistic programming.
This page was built for publication: Gaining traction: on the convergence of an inner approximation scheme for probability maximization
