A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
From MaRDI portal
Publication:535064
Recommendations
Cites work
- scientific article; zbMATH DE number 1322222 (Why is no real title available?)
- scientific article; zbMATH DE number 4114379 (Why is no real title available?)
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A branch and bound method for stochastic integer problems under probabilistic constraints
- A stochastic approach to stability in stochastic programming
- Ambiguous chance constrained problems and robust optimization
- An integer programming approach for linear programs with probabilistic constraints
- Chance Constrained Programming with Joint Constraints
- Concavity and efficient points of discrete distributions in probabilistic programming.
- Contributions to the theory of stochastic programming
- Convex Approximations of Chance Constrained Programs
- Convexity of chance constraints with independent random variables
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- Dual methods for probabilistic optimization problems.
- Hölder and Lipschitz stability of solution sets in programs with probabilistic constraints
- Lectures on Stochastic Programming
- Metric regularity and quantitative stability in stochastic programs with probabilistic constraints.
- Monte Carlo sampling approach to stochastic programming
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- On convex probabilistic programming with discrete distributions.
- On geometric optimization with few violated constraints
- Optimization models with probabilistic constraints
- Probabilistic design of LPV control systems.
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Probabilistic robust design with linear quadratic regulators
- Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
- Randomized Strategies for Probabilistic Solutions of Uncertain Feasibility and Optimization Problems
- Randomized algorithms for analysis and control of uncertain systems. With a foreword by M. Vidyasagar
- Randomized algorithms for probabilistic robustness with real and complex structured uncertainty.
- Randomized algorithms for quadratic stability of quantized sampled-data systems
- Relaxations for probabilistically constrained programs with discrete random variables
- Robust optimization-methodology and applications
- Robust solutions of linear programming problems contaminated with uncertain data
- Scenario approximations of chance constraints
- Sharp Bounds on Probabilities Using Linear Programming
- Statistical learning theory: a pack-based strategy for uncertain feasibility and optimization problems
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- The Price of Robustness
- The Scenario Approach to Robust Control Design
- Uncertain convex programs: randomized solutions and confidence levels
- Worst-case properties of the uniform distribution and randomized algorithms for robustness analysis
Cited in
(83)- On Conditional Risk Assessments in Scenario Optimization
- Robust control of uncertain systems: classical results and recent developments
- The decision rule approach to optimization under uncertainty: methodology and applications
- Scenario MIN-MAX optimization and the risk of empirical costs
- A linear programming approach for linear programs with probabilistic constraints
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
- A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs
- Analytic approximation and differentiability of joint chance constraints
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- Varying confidence levels for CVaR risk measures and minimax limits
- Risk-return trade-off with the scenario approach in practice: a case study in portfolio selection
- Stochastic MPC with offline uncertainty sampling
- Research on probabilistic methods for control system design
- Chance-constrained problems and rare events: an importance sampling approach
- Decomposition algorithms for two-stage chance-constrained programs
- Model reduction of switched affine systems
- FAST—Fast Algorithm for the Scenario Technique
- Generalized differentiation of probability functions: parameter dependent sets given by intersections of convex sets and complements of convex sets
- A distributionally robust optimization approach for two-stage facility location problems
- An inner-outer approximation approach to chance constrained optimization
- Expected shortfall: heuristics and certificates
- Risk and complexity in scenario optimization
- Bi-objective autonomous vehicle repositioning problem with travel time uncertainty
- Random sampling with removal
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
- Advances and applications of chance-constrained approaches to systems optimisation under uncertainty
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- Probability maximization via Minkowski functionals: convex representations and tractable resolution
- A polyhedral study of the static probabilistic lot-sizing problem
- Wait-and-judge scenario optimization
- A stochastic primal-dual method for a class of nonconvex constrained optimization
- A constraint sampling approach for multi-stage robust optimization
- On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling
- Data-driven tuning for chance constrained optimization: analysis and extensions
- Frequentist history matching with interval predictor models
- Calibration of a radiation quality model for sparse and uncertain data
- Stochastic model predictive control with adaptive constraint tightening for non-conservative chance constraints satisfaction
- Scenario-based verification of uncertain MDPs
- Chance-constrained sets approximation: a probabilistic scaling approach
- Optimal disturbance compensation for constrained linear systems operating in stationary conditions: a scenario-based approach
- On the quantification of aleatory and epistemic uncertainty using sliced-normal distributions
- A polyhedral study on chance constrained program with random right-hand side
- On a class of interval predictor models with universal reliability
- Chance-Constrained Binary Packing Problems
- General properties of two-stage stochastic programming problems with probabilistic criteria
- Randomized methods for design of uncertain systems: sample complexity and sequential algorithms
- Partial sample average approximation method for chance constrained problems
- A theory of the risk for empirical CVaR with application to portfolio selection
- Automated driving: the role of forecasts and uncertainty -- a control perspective
- Learning noisy functions via interval models
- Stochastic self-triggered MPC for linear constrained systems under additive uncertainty and chance constraints
- Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity
- Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints
- Trading performance for state constraint feasibility in stochastic constrained control: a randomized approach
- Derivatives of probability functions: unions of polyhedra and elliptical distributions
- Consistency of the scenario approach
- Generalized differentiation of probability functions acting on an infinite system of constraints
- Performance assessment and design of abstracted models for stochastic hybrid systems through a randomized approach
- On the sample size of random convex programs with structured dependence on the uncertainty
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- The scenario approach for stochastic model predictive control with bounds on closed-loop constraint violations
- Sampling-Based Verification of CTMCs with Uncertain Rates
- Robust Control for Dynamical Systems with Non-Gaussian Noise via Formal Abstractions
- Regret optimal control for uncertain stochastic systems
- Conditional scenario-based model predictive control
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- Formal controller synthesis for Markov jump linear systems with uncertain dynamics
- A polynomial approximation-based approach for chance-constrained optimization
- Parametric scenario optimization under limited data: a distributionally robust optimization view
- Approximate methods for solving chance-constrained linear programs in probability measure space
- A limited-memory BFGS-based differential evolution algorithm for optimal control of nonlinear systems with mixed control variables and probability constraints
- Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints
- An empirical quantile estimation approach for chance-constrained nonlinear optimization problems
- General feasibility bounds for sample average approximation via Vapnik-Chervonenkis dimension
- Optimal control of nonlinear systems with integer‐valued control inputs and stochastic constraints
- Parameter synthesis for Markov models: covering the parameter space
- A randomized relaxation method to ensure feasibility in stochastic control of linear systems subject to state and input constraints
- Random variables with moment-matching staircase density functions
- A stochastic moving ball approximation method for smooth convex constrained minimization
- Learning stability guarantees for constrained switching linear systems from noisy observations
- Non-convex scenario optimization
- Virtual reference feedback tuning for linear discrete-time systems with robust stability guarantees based on set membership
- Approximate convex hull based scenario truncation for chance constrained trajectory optimization
This page was built for publication: A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535064)
