A perspective-based convex relaxation for switched-affine optimal control
type: Item
instance of: scholarly article
title: A perspective-based convex relaxation for switched-affine optimal control
zbMATH Open document ID: 1325.93026
author: Nicholas Moehle
author: Stephen Boyd
published in: Systems \& Control Letters
publication date: 2015-11-19T00:00:00Z
Mathematics Subject Classification ID: 93B11
Mathematics Subject Classification ID: 49M30
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6511969
zbMATH Keywords: switched-affine systems
zbMATH Keywords: optimal control
zbMATH Keywords: mixed-integer convex programming
zbMATH Keywords: hybrid systems
zbMATH Keywords: disjunctive programming
describes a project that uses: Convex.jl
describes a project that uses: Mosek
describes a project that uses: HYSDEL
describes a project that uses: ECOS
describes a project that uses: CVX
MaRDI profile type: Publication
full work available at URL: j.sysconle.2015.09.002
OpenAlex ID: W2233656699
cites work: Control of systems integrating logic, dynamics, and constraints
cites work: Disjunctive Programming
cites work: Convex programming for disjunctive convex optimization
cites work: Perspective Reformulation and Applications
cites work: Q4736607
cites work: Optimization of Discrete-Continuous Dynamic Systems Based on Disjunctive Programming
cites work: Logic-Based Solution Methods for Optimal Control of Hybrid Systems
cites work: Combinatorial integral approximation
cites work: The Lagrangian relaxation for the combinatorial integral approximation problem
cites work: Q4821526
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Second-order cone programming
cites work: Semidefinite Programming
cites work: Q5599348
cites work: Graph Implementations for Nonsmooth Convex Programs
cites work: Shrinking-horizon dynamic programming
cites work: Discrete-time hybrid modeling and verification of the batch evaporator process benchmark
cites work: The Linear Programming Approach to Approximate Dynamic Programming
cites work: Q4496016
DOI: 10.1016/J.SYSCONLE.2015.09.002
description: scientific article; zbMATH DE number 6511969