A perspective-based convex relaxation for switched-affine optimal control
From MaRDI portal
Publication:893481
DOI10.1016/j.sysconle.2015.09.002zbMath1325.93026OpenAlexW2233656699MaRDI QIDQ893481
Nicholas Moehle, Stephen P. Boyd
Publication date: 19 November 2015
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2015.09.002
optimal controlhybrid systemsdisjunctive programmingmixed-integer convex programmingswitched-affine systems
Convex programming (90C25) Mixed integer programming (90C11) System structure simplification (93B11)
Related Items
Computational approaches for mixed integer optimal control problems with indicator constraints, Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective, Perspective functions: properties, constructions, and examples, Shortest Paths in Graphs of Convex Sets, Minimizing a sum of clipped convex functions, Adaptive numerical approach for optimal control of a single train
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial integral approximation
- Control of systems integrating logic, dynamics, and constraints
- Second-order cone programming
- Convex programming for disjunctive convex optimization
- Discrete-time hybrid modeling and verification of the batch evaporator process benchmark
- Lectures on Modern Convex Optimization
- Perspective Reformulation and Applications
- The Lagrangian relaxation for the combinatorial integral approximation problem
- Graph Implementations for Nonsmooth Convex Programs
- Shrinking-horizon dynamic programming
- Optimization of Discrete-Continuous Dynamic Systems Based on Disjunctive Programming
- The Linear Programming Approach to Approximate Dynamic Programming
- Disjunctive Programming
- Semidefinite Programming
- Logic-Based Solution Methods for Optimal Control of Hybrid Systems