On the Connection Between Compression Learning and Scenario Based Single-Stage and Cascading Optimization Problems

DOI10.1109/TAC.2015.2394874zbMath1360.68693OpenAlexW2018878471MaRDI QIDQ2982553

Kostas Margellos, Maria Prandini, John Lygeros

Publication date: 16 May 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2015.2394874

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05) Stochastic programming (90C15)

Related Items (10)

On the computational complexity and generalization properties of multi-stage and stage-wise coupled scenario programs ⋮ On the probabilistic feasibility of solutions in multi-agent optimization problems under uncertainty ⋮ Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints ⋮ On Conditional Risk Assessments in Scenario Optimization ⋮ Trading performance for state constraint feasibility in stochastic constrained control: a randomized approach ⋮ Unnamed Item ⋮ Wait-and-judge scenario optimization ⋮ A randomized relaxation method to ensure feasibility in stochastic control of linear systems subject to state and input constraints ⋮ Probabilistic feasibility guarantees for solution sets to uncertain variational inequalities ⋮ Risk and complexity in scenario optimization

This page was built for publication: On the Connection Between Compression Learning and Scenario Based Single-Stage and Cascading Optimization Problems