Uncertain convex programs: randomized solutions and confidence levels

From MaRDI portal

Publication:1769067

Jump to:navigation, search

DOI10.1007/s10107-003-0499-yzbMath1177.90317OpenAlexW2117781171MaRDI QIDQ1769067

Marco C. Campi, Giuseppe Carlo Calafiore

Publication date: 17 March 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0499-y

Mathematics Subject Classification ID

Convex programming (90C25) Stochastic programming (90C15) Semi-infinite programming (90C34)

Related Items

Robust Control for Dynamical Systems with Non-Gaussian Noise via Formal Abstractions, Automatic robust convex programming, Scenario-Based Verification of Uncertain MDPs, Periodic supply vessel planning under demand and weather uncertainty, Robust control of uncertain multi-inventory systems via linear matrix inequality, Scenario Min-Max Optimization and the Risk of Empirical Costs, Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization, Oracle-Based Robust Optimization via Online Learning, Stochastic Cutting Planes for Data-Driven Optimization, ROPI—a robust optimization programming interface for C++, Optimization under Rare Chance Constraints, FAST—Fast Algorithm for the Scenario Technique, A Framework for Solving Chance-Constrained Linear Matrix Inequality Programs, An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems, General Feasibility Bounds for Sample Average Approximation via Vapnik--Chervonenkis Dimension, Chance-Constrained Binary Packing Problems, Robust DC optimal power flow with modeling of solar power supply uncertainty via R-vine copulas, Minimax decision rules for planning under uncertainty: drawbacks and remedies, Nonlinear set membership filter with state estimation constraints via consensus-ADMM, Scenario Approach for Minmax Optimization with Emphasis on the Nonconvex Case: Positive Results and Caveats, Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem, An Inner-Outer Approximation Approach to Chance Constrained Optimization, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints, On Conditional Risk Assessments in Scenario Optimization, Simple and fast algorithm for binary integer and online linear programming, Chance-constrained set covering with Wasserstein ambiguity, Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints, On Feasibility of Sample Average Approximation Solutions, Solving Chance-Constrained Problems via a Smooth Sample-Based Nonlinear Approximation, Helly’s theorem: New variations and applications, Online First-Order Framework for Robust Convex Optimization, Networked Parallel Algorithms for Robust Convex Optimization via the Scenario Approach, Robustℓ₁performance analysis for linear systems with parametric uncertainties, Unnamed Item, Statistical Learning Theory: A Pack-based Strategy for Uncertain Feasibility and Optimization Problems, Analytic approximation and differentiability of joint chance constraints, Discussion on: ``GPC robust design using linear and/or bilinear matrix inequalities, Unnamed Item, Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization, Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control, Tractable algorithms for chance-constrained combinatorial problems, Statistical Optimization in High Dimensions, Generation of signals with specified second-order properties for constrained systems, Convergence analysis on a smoothing approach to joint chance constrained programs, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMS, Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets, Probabilistic Guarantees in Robust Optimization, Advances and applications of chance-constrained approaches to systems optimisation under uncertainty, Application of interval predictor model into robust model predictive control, Monte Carlo Methods for Value-at-Risk and Conditional Value-at-Risk, Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey, The CoMirror algorithm with random constraint sampling for convex semi-infinite programming, A smooth approximation approach for optimization with probabilistic constraints based on sigmoid function, On incremental approximate saddle-point computation in zero-sum matrix games, Chance-constrained problems and rare events: an importance sampling approach, Decomposition algorithms for two-stage chance-constrained programs, Varying zonotopic tube RMPC with switching logic for lateral path tracking of autonomous vehicle, Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, Data-driven chance constrained stochastic program, Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty, A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand, Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs, Average flow constraints and stabilizability in uncertain production-distribution systems, Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods, Relaxations and approximations of chance constraints under finite distributions, Probabilistic optimization via approximate \(p\)-efficient points and bundle methods, Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs, Frameworks and results in distributionally robust optimization, Optimization with a class of multivariate integral stochastic order constraints, Scenario approximation of robust and chance-constrained programs, Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities, Optimization under uncertainty with applications to design of truss structures, On safe tractable approximations of chance constraints, Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs, Stochastic assembly line balancing: general bounds and reliability-based branch-and-bound algorithm, Almost budget balanced mechanisms with scalar bids for allocation of a divisible good, Integrated facility location and production scheduling in multi-generation energy systems, Multi-resource allocation in stochastic project scheduling, Pattern definition of the \(p\)-efficiency concept, A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support, Risk-return trade-off with the scenario approach in practice: a case study in portfolio selection, Gradient and Hessian of joint probability function with applications on chance-constrained programs, A distributionally robust optimization approach for two-stage facility location problems, On the sample size of random convex programs with structured dependence on the uncertainty, Worst-case violation of sampled convex programs for optimization with uncertainty, Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints, Random sampling with removal, A polyhedral study of the static probabilistic lot-sizing problem, A constraint sampling approach for multi-stage robust optimization, Convex relaxations of chance constrained optimization problems, Identifying effective scenarios in distributionally robust stochastic programs with total variation distance, Robust control of uncertain systems: classical results and recent developments, A statistical learning theory approach for uncertain linear and bilinear matrix inequalities, Performance assessment and design of abstracted models for stochastic hybrid systems through a randomized approach, Large-scale unit commitment under uncertainty: an updated literature survey, Multipolar robust optimization, Cascading: An adjusted exchange method for robust conic programming, A survey of adjustable robust optimization, Genetic algorithm based technique for solving chance constrained problems, An approximation scheme for stochastic programs with second order dominance constraints, On two-stage convex chance constrained problems, Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems, Trading performance for state constraint feasibility in stochastic constrained control: a randomized approach, On robust input design for nonlinear dynamical models, Wait-and-judge scenario optimization, Robust stability of stochastic systems with varying delays: application to RLC circuit with intermittent closed-loop, Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs, The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks, A robust approach to the chance-constrained knapsack problem, Computing near-optimal value-at-risk portfolios using integer programming techniques, A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs, Robust unit commitment with \(n-1\) security criteria, A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality, Solving chance-constrained combinatorial problems to optimality, \(\alpha \)-conservative approximation for probabilistically constrained convex programs, Robust stability of Markov jump linear systems through randomized evaluations, Stochastic task networks -- trading performance for stability, A relaxation algorithm with a probabilistic guarantee for robust deviation optimization, Ambiguous chance constrained problems and robust optimization, Learning noisy functions via interval models, Robust resource allocations in temporal networks, Saddle point approximation approaches for two-stage robust optimization problems, Research on probabilistic methods for control system design, Mathematical programming approaches for generating \(p\)-efficient points, Optimal disturbance compensation for constrained linear systems operating in stationary conditions: a scenario-based approach, LMI relaxations in robust control, Derivative-free robust optimization by outer approximations, A dynamic game approach to distributionally robust safety specifications for stochastic systems, A stochastic primal-dual method for optimization with conditional value at risk constraints, Varying confidence levels for CVaR risk measures and minimax limits, Branch-and-cut approaches for chance-constrained formulations of reliable network design problems, Interval predictor models: identification and reliability, Approximate cutting plane approaches for exact solutions to robust optimization problems, A randomized relaxation method to ensure feasibility in stochastic control of linear systems subject to state and input constraints, Partial sample average approximation method for chance constrained problems, A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs, A theory of the risk for empirical CVaR with application to portfolio selection, The wait-and-judge scenario approach applied to antenna array design, On the expected probability of constraint violation in sampled convex programs, Cutting plane algorithms for solving a stochastic edge-partition problem, On the resolution of misspecified convex optimization and monotone variational inequality problems, An inexact primal-dual algorithm for semi-infinite programming, Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens, Near-optimal solutions of convex semi-infinite programs via targeted sampling, Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity, On sample average approximation for two-stage stochastic programs without relatively complete recourse, Randomized methods for design of uncertain systems: sample complexity and sequential algorithms, Large-scale unit commitment under uncertainty, Risk and complexity in scenario optimization, Dynamic traffic assignment under uncertainty: a distributional robust chance-constrained approach

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1769067&oldid=14116677"