Abstract
In this article, we present some global optimality conditions for mixed quadratic programming problems. Our approach is based on a L-subdifferential and an associated L-normal cone. Unlike most subdifferentials, the L-subdifferential is formed by functions that are not necessarily linear functions. We derive some sufficient and necessary global optimality conditions for mixed quadratic programs with box constraints and binary constraints. †Dedicated in the memory of Alexander Rubinov.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have