Search Results - Instance Library, Quadratic Programming

QPLIB: a library of quadratic programming instances by Furini, Fabio, Traversi, Emiliano, Belotti, Pietro, Frangioni, Antonio, Gleixner, Ambros, Gould, Nick, Liberti, Leo, Lodi, Andrea, Misener, Ruth, Mittelmann, Hans, Sahinidis, Nikolaos V., Vigerske, Stefan, Wiegele, Angelika

“…This paper describes a new instance library for quadratic programming (QP), i.e., the family of continuous and (mixed…”
Get full text

Penalized semidefinite programming for quadratically-constrained quadratic optimization by Madani, Ramtin, Kheirandishfard, Mohsen, Lavaei, Javad, Atamtürk, Alper

“…In this paper, we give a new penalized semidefinite programming approach for non-convex quadratically-constrained quadratic programs (QCQPs…”
Get full text

Multiple instance classification via quadratic programming by Küçükaşcı, Emel Şeyma, Baydoğan, Mustafa Gökçe, Taşkın, Z. Caner

“… In this study, we present a novel quadratic programming (QP)-based approach to classify bags. Solution of our QP formulation links the instance-level contributions…”
Get full text

Simultaneous selection and displacement of buildings and roads for map generalization via mixed-integer quadratic programming by Rosenberger, Leon, Shen, Yilang, Haunert, Jan-Henrik

“… We model both processes together as an optimization problem in the form of a mixed-integer quadratic program and demonstrate that it can be optimally solved using a mathematical problem solver…”
Get full text

QAPLIB – A Quadratic Assignment Problem Library by Burkard, Rainer E., Karisch, Stefan E., Rendl, Franz

“…A collection of electronically available data instances for the QuadraticAssignment Problem is described…”
Get full text

OSQP: an operator splitting solver for quadratic programs by Stellato, Bartolomeo, Banjac, Goran, Goulart, Paul, Bemporad, Alberto, Boyd, Stephen

“…We present a general-purpose solver for convex quadratic programs based on the alternating direction method of multipliers, employing a novel operator splitting technique that requires the solution…”
Get full text

Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem by de Klerk, Etienne, Sotirov, Renata

“… Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: (Burkard et al…”
Get full text

Compact mixed-integer programming formulations in quadratic optimization by Beach, Benjamin, Hildebrand, Robert, Huchette, Joey

“…We present a technique for producing valid dual bounds for nonconvex quadratic optimization problems…”
Get full text

A new algorithm for concave quadratic programming by Zamani, Moslem

“…The main outcomes of the paper are divided into two parts. First, we present a new dual for quadratic programs, in which, the dual variables are affine functions, and we prove strong duality…”
Get full text

Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations by Gondzio, Jacek, Yıldırım, E. Alper

“…) quadratic form over the unit simplex. We focus on reformulating a standard quadratic program as a mixed integer linear programming problem…”
Get full text

A branch-and-cut algorithm for Mixed-Integer Bilinear Programming by Fischetti, Matteo, Monaci, Michele

“… the algorithm’s performance on a large instance set from the literature. In this paper, we consider the Mixed-Integer Bilinear Programming problem, a widely-used reformulation of the classical mixed-integer quadratic programming problem…”
Get full text

Multiple Instance Classification via Successive Linear Programming by Mangasarian, O. L., Wild, E. W.

“…The multiple instance classification problem (Dietterich et al., Artif. Intell. 89:31–71, [ 1998 ]; Auer, Proceedings of 14th International Conference on Machine Learning, pp…”
Get full text

Feature subset selection by gravitational search algorithm optimization by Han, XiaoHong, Chang, XiaoMing, Quan, Long, Xiong, XiaoYan, Li, JingXia, Zhang, ZhaoXia, Liu, Yi

“… The key to the success of the MGSA is to utilize the piecewise linear chaotic map for increasing its diversity of species, and to use sequential quadratic programming for accelerating local exploitation…”
Get full text

Penalized Semidefinite Programming for Quadratically-Constrained Quadratic Optimization by Madani, Ramtin, Kheirandishfard, Mohsen, Lavaei, Javad, Atamturk, Alper

“…In this paper, we give a new penalized semidefinite programming approach for non-convex quadratically-constrained quadratic programs (QCQPs…”
Get full text

Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables by Wang, Yang, Wu, Qinghua, Punnen, Abraham P., Glover, Fred

“…•Find improved solutions for 14 instances. The bipartite boolean quadratic programming problem with partitioned variables (BQP-PV…”
Get full text

On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints by Qiu, Yuzhou, Yıldırım, E. Alper

“…Quadratic programs with box constraints involve minimizing a possibly nonconvex quadratic function subject to lower and upper bounds on each variable…”
Get full text

Assessment of a two-step approach for global optimization of mixed-integer polynomial programs using quadratic reformulation by Karia, Tanuj, Adjiman, Claire S., Chachuat, Benoît

“…•Investigation of preprocessing strategies and redundant quadratic constraints on performance of MIQCP reformulation…”
Get full text

Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation by Elloumi, Sourour, Lambert, Amélie, Lazare, Arnaud

“…) with a specially-tailored quadratic convex reformulation method. In particular, this method relies, in a pre-processing step, on the resolution of a semi-definite programming problem where the link between initial and additional variables is used…”
Get full text

Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry by de Klerk, Etienne, Sotirov, Renata

“…Semidefinite programming (SDP) bounds for the quadratic assignment problem (QAP) were introduced in Zhao et al. (J Comb Optim 2:71–109, 1998…”
Get full text

Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming by Andrade, Tiago, Oliveira, Fabricio, Hamacher, Silvio, Eberhard, Andrew

“…). These relaxations constitute a key component for some methods for solving nonconvex mixed-integer quadratically constrained quadratic programming (MIQCQP) problems…”
Get full text