Probabilistic optimization via approximate \(p\)-efficient points and bundle methods

From MaRDI portal
Publication:1652036

DOI10.1016/j.cor.2016.08.002zbMath1391.90450OpenAlexW2500599198MaRDI QIDQ1652036

V. Berge, Welington de Oliveira, Claudia A. Sagastizábal, Wim van Ackooij

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.08.002



Related Items

Solving joint chance constrained problems using regularization and Benders' decomposition, Construction of confidence absorbing set for analysis of static stochastic systems, Nonlinear chance constrained problems: optimality conditions, regularization and solvers, Uncontrolled inexact information within bundle methods, Derivatives of probability functions: unions of polyhedra and elliptical distributions, Eventual convexity of probability constraints with elliptical distributions, A polyhedral study on chance constrained program with random right-hand side, Probability maximization via Minkowski functionals: convex representations and tractable resolution, Robot Dance: a mathematical optimization platform for intervention against COVID-19 in a complex network, Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory, Parametric algorithm for finding a guaranteed solution to a quantile optimization problem, Incremental Bundle Methods using Upper Models, Unnamed Item, Construction of confidence absorbing sets using statistical methods, On the Convexity of Level-sets of Probability Functions, Regularized decomposition of large scale block-structured robust optimization problems, Gaining traction: on the convergence of an inner approximation scheme for probability maximization, A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs, Generalized Differentiation of Probability Functions Acting on an Infinite System of Constraints, A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes, Generalized differentiation of probability functions: parameter dependent sets given by intersections of convex sets and complements of convex sets


Uses Software


Cites Work