Optimization Online


Gaining traction - On the convergence of an inner approximation scheme for probability maximization

Csaba Fabian (fabian.csaba***at***gamf.uni-neumann.hu)

Abstract: We analyze an inner approximation scheme for probability maximization. The approach was proposed in Fabian, Csizmas, Drenyovszki, Van Ackooij, Vajnai, Kovacs, Szantai (2018) Probability maximization by inner approximation, Acta Polytechnica Hungarica 15:105-125, as an analogue of a classic dual approach in the handling of probabilistic constraints. Even a basic implementation of the maximization scheme proved usable and endured noise in gradient computations without any special effort. Moreover the speed of convergence was not affected by approximate computation of test points. This robustness was then explained in an idealized setting, considering a globally well-conditioned objective function. Here we work out convergence proofs for a logconcave distribution, specifically, for a normal distribution. The main result of the present paper is that the procedure gains traction as an optimal solution is approached.

Keywords: Probabilistic problems, Cutting-plane method

Category 1: Stochastic Programming

Category 2: Convex and Nonsmooth Optimization (Convex Optimization )

Citation: Updated version: https://link.springer.com/article/10.1007/s10100-020-00697-3

Download: [PDF]

Entry Submitted: 08/14/2019
Entry Accepted: 08/14/2019
Entry Last Modified: 07/22/2020

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society