Skip to content
Research Article Open access CC BY 4.0

Quadrex Algorithm for Negative Definite Quadratic Programming Models

Mark Ivan P. Arcillas, Elmer C. Castillano

Journal of Advances in Mathematics and Computer Science · pp. 57–65 · Published 2 Aug 2022

10.9734/jamcs/2022/v37i630461

Abstract

In this paper, a quadrex algorithm for quadratic programming problems is introduced (n = 2) under linear and quadratic constraints. The quadrex algorithm considers on the behavior of the quadratic function near the origin or a translate of the origin, performs a series of translations and orthogonal rotations to obtain the optimal solution of the objective function as well as taking considerations on the constraints of the problem. The method works provided that the eigenvalues of the matrix on quadratic form of the objective function is strictly negative, that is, Q is negative-definite. The quadrex algorithm is a parallel counterpart of the simplex algorithm for linear programming models.

Simplex quadratic quadratic programming quadrex NP-hard negative denite.

Cited by 0

No indexed citations yet.

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.