Regularization methods for optimization problems with probabilistic constraints
From MaRDI portal
Publication:1949268
DOI10.1007/s10107-012-0539-6zbMath1276.90043OpenAlexW2090364210MaRDI QIDQ1949268
Gabriela Martinez, Dentcheva, Darinka
Publication date: 6 May 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0539-6
Related Items
Solving joint chance constrained problems using regularization and Benders' decomposition, Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, Probabilistic optimization via approximate \(p\)-efficient points and bundle methods, Uncontrolled inexact information within bundle methods, On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints, An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems, Chance-Constrained Binary Packing Problems, Chance constrained unit commitment approximation under stochastic wind energy, Derivatives of probability functions: unions of polyhedra and elliptical distributions, Eventual convexity of probability constraints with elliptical distributions, Augmented Lagrangian method for probabilistic optimization, A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support, An Inner-Outer Approximation Approach to Chance Constrained Optimization, Robot Dance: a mathematical optimization platform for intervention against COVID-19 in a complex network, A characterization of the subdifferential of singular Gaussian distribution functions, On the Convexity of Level-sets of Probability Functions, Minimization of a class of rare event probabilities and buffered probabilities of exceedance, Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs, Convergence Analysis for Mathematical Programs with Distributionally Robust Chance Constraint, Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables, 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, Convergence analysis on a smoothing approach to joint chance constrained programs, Generalized differentiation of probability functions: parameter dependent sets given by intersections of convex sets and complements of convex sets, Probabilistic constraints via SQP solver: application to a renewable energy management problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dual methods for probabilistic optimization problems.
- An integer programming approach for linear programs with probabilistic constraints
- Mathematical programming approaches for generating \(p\)-efficient points
- Relaxations for probabilistically constrained programs with discrete random variables
- \(\alpha\)-concave functions and measures and their applications
- Bounds for probabilistic integer programming problems
- Methods of descent for nondifferentiable optimization
- The multiplier method of Hestenes and Powell applied to convex programming
- Lectures on Stochastic Programming
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Concavity and efficient points of discrete distributions in probabilistic programming.