Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Global Optimization"
DOI: 10.1007/s10898-017-0591-0
Abstract: We investigate in this paper nonconvex binary quadratically constrained quadratic programming (QCQP) which arises in various real-life fields. We propose a novel approach of getting quadratic convex reformulation (QCR) for this class of optimization problem.… read more here.
Keywords: programming; constrained quadratic; binary quadratically; quadratically constrained ... See more keywords
Structured linear reformulation of binary quadratically constrained quadratic programs
Sign Up to like & getrecommendations! Published in 2020 at "Optimization Letters"
DOI: 10.1007/s11590-018-1361-8
Abstract: This paper presents a new linear reformulation to convert a binary quadratically constrained quadratic program into a 0–1 mixed integer linear program. By exploiting the symmetric structure of the quadratic terms embedded in the objective… read more here.
Keywords: linear reformulation; binary quadratically; constrained quadratic; structured linear ... 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
Optimal Sensor Placement for Dilution of Precision Minimization Via Quadratically Constrained Fractional Programming
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Transactions on Aerospace and Electronic Systems"
DOI: 10.1109/taes.2018.2879552
Abstract: An approach to find the global optimal solution of the dilution of precision (DOP) problem is presented. The DOP optimization problem considered assumes an environment comprising multiple randomly predeployed sensors (or navigation sources) and an… read more here.
Keywords: dilution precision; constrained fractional; problem; dop ... See more keywords
Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Industrial and Management Optimization"
DOI: 10.3934/jimo.2020071
Abstract: The paper proposes a novel class of quadratically constrained convex reformulations (QCCR) for semi-continuous quadratic programming. We first propose the class of QCCR for the studied problem. Next, we discuss how to polynomially find the… read more here.
Keywords: quadratically constrained; continuous quadratic; constrained convex; convex reformulations ... See more keywords