Results 221 to 230 of about 40,565 (244)
Some of the next articles are maybe not open access.
Convex reformulations for binary quadratic programs
2009-Let (QP) be a binary quadratic program that consists in minimizing a quadratic function subject to linear constraints. To solve (QP) we reformulate it into an equivalent program with a convex objective function. Our reformulation, that we call EQCR (Extended Quadratic Convex Reformulation), is optimal from the continuous relaxation bound point of view.
Billionnet, Alain +2 more
openaire +1 more source
Convex Quadratic Programming for Slimming Convolutional Networks
2022 IEEE International Conference on Image Processing (ICIP), 2022openaire +2 more sources
Convex reformulations for integer quadratic programs
2009-Let (QP) be an integer quadratic program that consists in minimizing a quadratic functionsubject to linear constraints. To solve (QP), we reformulate it into an equivalent program with a convex objective function, and we use a Mixed Integer Quadratic Programming solver. This reformulation, called IQCR, is optimal in a certain sense from the continuous
Billionnet, Alain +2 more
openaire +1 more source
Neural network for solving convex quadratic bilevel programming problems
Neural Networks, 2014Chuandong Li, Tingwen Huang, Chaojie Li
exaly
A neural network model for solving convex quadratic programming problems with some applications
Engineering Applications of Artificial Intelligence, 2014Alireza Nazemi
exaly