Solving 0–1 Quadratic Programs by Reformulation Techniques
Sign Up to like & getrecommendations! Published in 2017 at "Industrial & Engineering Chemistry Research"
DOI: 10.1021/acs.iecr.7b01270
Abstract: We derive and study a reformulation technique for general 0–1 quadratic programs (QP) that uses diagonal as well as nondiagonal perturbation of the objective function. The technique is an extension of the Quadratic Convex Reformulation… read more here.
Keywords: technique; quadratic programs; solving quadratic; qcr method ... See more keywords
Control Barrier Function-Based Quadratic Programs Introduce Undesirable Asymptotically Stable Equilibria
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Control Systems Letters"
DOI: 10.1109/lcsys.2020.3004797
Abstract: Control Lyapunov functions (CLFs) and control barrier functions (CBFs) have been used to develop provably safe controllers by means of quadratic programs (QPs), guaranteeing safety in the form of trajectory invariance with respect to a… read more here.
Keywords: barrier function; control; control barrier; quadratic programs ... See more keywords
Sampled-Data Stabilization With Control Lyapunov Functions via Quadratically Constrained Quadratic Programs
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Control Systems Letters"
DOI: 10.1109/lcsys.2021.3085172
Abstract: Controller design for nonlinear systems with Control Lyapunov Function (CLF) based quadratic programs has recently been successfully applied to a diverse set of difficult control tasks. These existing formulations do not address the gap between… read more here.
Keywords: control; control lyapunov; sampled data; quadratic programs ... See more keywords
Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Industrial and Management Optimization"
DOI: 10.3934/jimo.2017064
Abstract: Quadratic programs with complementarity constraints (QPCC) are NP-hard due to the nonconvexity of complementarity relation between the pairs of nonnegative variables. Most of the existing solvers are capable of solving QPCC by finding stationary solutions,… read more here.
Keywords: programs convex; quadratic programs; solving quadratic; complementarity constraints ... See more keywords