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
Practical and Secure Outsourcing Algorithms for Solving Quadratic Congruences in Internet of Things
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Internet of Things Journal"
DOI: 10.1109/jiot.2020.2964015
Abstract: Solving quadratic congruences is a widely applied operation in cryptographic protocols to ensure the data secrecy in the Internet of Things (IoT). Yet it requires unaffordable computation resource for resource-constrained IoT devices when bulk of… read more here.
Keywords: practical secure; internet things; iot devices; solving quadratic ... 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