Convex relaxations for mixed integer predictive control
From MaRDI portal
Publication:710707
Recommendations
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Semidefinite programming relaxation for nonconvex quadratic programs
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
Cites work
- scientific article; zbMATH DE number 3470175 (Why is no real title available?)
- scientific article; zbMATH DE number 1302192 (Why is no real title available?)
- Approximating quadratic programming with bound and quadratic constraints
- Control of systems integrating logic, dynamics, and constraints
- Global optimization with polynomials and the problem of moments
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA
- Semidefinite programming relaxations and algebraic optimization in control
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(12)- Trajectory generation for the unicycle model using semidefinite relaxations
- scientific article; zbMATH DE number 1208198 (Why is no real title available?)
- Impulsively-controlled systems and reverse dwell time: a linear programming approach
- LMI-based robust mixed-integer model predictive control for hybrid systems
- Decomposition and mean-field approach to mixed integer optimal compensation problems
- Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications
- Finite alphabet control of logistic networks with discrete uncertainty
- A perspective-based convex relaxation for switched-affine optimal control
- Warm Start of Mixed-Integer Programs for Model Predictive Control of Hybrid Systems
- Norm-optimal iterative learning control in an integer-valued control domain
- A coalitional control scheme with applications to cooperative game theory
- An alternative use of the Riccati recursion for efficient optimization
This page was built for publication: Convex relaxations for mixed integer predictive control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710707)
