Convex relaxations for mixed integer predictive control

DOI10.1016/j.automatica.2010.06.015zbMath1201.93026OpenAlexW2108354097MaRDI QIDQ710707

D. Kharzeev

Publication date: 22 October 2010

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-60254

zbMATH Keywords

integer programminghybrid systemssemidefinite programmingpredictive controlfinite alphabet control

Mathematics Subject Classification ID

Semidefinite programming (90C22) Integer programming (90C10) Transformations (93B17) Linear-quadratic optimal control problems (49N10) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items

Decomposition and mean-field approach to mixed integer optimal compensation problems, A coalitional control scheme with applications to cooperative game theory, Norm-optimal iterative learning control in an integer-valued control domain, Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications, Finite alphabet control of logistic networks with discrete uncertainty, An alternative use of the Riccati recursion for efficient optimization, LMI-based robust mixed-integer model predictive control for hybrid systems, Impulsively-controlled systems and reverse dwell time: a linear programming approach

Uses Software

• Matlab
• SDPT3
• YALMIP

Cites Work

• Unnamed Item
• Unnamed Item
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• Control of systems integrating logic, dynamics, and constraints
• Approximating quadratic programming with bound and quadratic constraints
• Semidefinite programming relaxations and algebraic optimization in control
• Global Optimization with Polynomials and the Problem of Moments
• On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
• Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA
• Handbook of semidefinite programming. Theory, algorithms, and applications