An Algorithm for Solving Quadratic Programming Problems [PDF]
Computer Science Journal of Moldova, 1997 Herein is investigated the method of solution of quadratic programming problems. The algorithm is based on the effective selection of constraints. Quadratic programming with constraints-equalities are solved with the help of an algorithm, so that matrix ...
V. Moraru
doaj +3 more sources
Reformulating mixed-integer quadratically constrained quadratic programs [PDF]
, 2011 It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a variety of optimisation problems. Moreover, in the particular case of mixed-integer quadratic programs, SDP has been used to reformulate problems, rather ...
Galli, L, Letchford, A. N.
core +4 more sources
Reformulations of mathematical programming problems as linear complementarity problems [PDF]
, 1982 A family of complementarity problems are defined as extensions of the well known Linear Complementarity Problem (LCP). These are (i.) Second Linear Complementarity Problem (SLCP) which is an LCP extended by introducing further equality restrictions and ...
Mitra, G, Judice, JJ
core +5 more sources
Gap inequalities for non-convex mixed-integer quadratic programs [PDF]
, 2011 Laurent and Poljak introduced a very general class of valid linear inequalities, called gap inequalities, for the max-cut problem. We show that an analogous class of inequalities can be defined for general non-convex mixed-integer quadratic programs ...
Galli, Laura +2 more
core +5 more sources
Vertical Jumping for Legged Robot Based on Quadratic Programming
Sensors, 2021 The highly dynamic legged jumping motion is a challenging research topic because of the lack of established control schemes that handle over-constrained control objectives well in the stance phase, which are coupled and affect each other, and control ...
Dingkui Tian +4 more
doaj +1 more source
A novel computational method for neutrosophic uncertainty related quadratic fractional programming problems [PDF]
Neutrosophic Sets and Systems, 2023 This study introduces a novel method for addressing the pentagonal quadratic fractional programming problem (PQFPP). We employ pentagonal neutrosophic numbers for the objective function's cost, resources, and technological coefficients.
S.A. Edalatpanah +3 more
doaj +1 more source
A Rank-Two Feasible Direction Algorithm for the Binary Quadratic Programming
Journal of Applied Mathematics, 2013 Based on the semidefinite programming relaxation of the binary quadratic programming, a rank-two feasible direction algorithm is presented. The proposed algorithm restricts the rank of matrix variable to be two in the semidefinite programming relaxation ...
Xuewen Mu, Yaling Zhang
doaj +1 more source
A new method for solving quadratic fractional programming problem in neutrosophic environment
Open Engineering, 2021 In the current study, a neutrosophic quadratic fractional programming (NQFP) problem is investigated using a new method. The NQFP problem is converted into the corresponding quadratic fractional programming (QFP) problem.
Khalifa Hamiden Abd El-Wahed +2 more
doaj +1 more source
An Algebraic-Based Primal–Dual Interior-Point Algorithm for Rotated Quadratic Cone Optimization
Computation, 2023 In rotated quadratic cone programming problems, we minimize a linear objective function over the intersection of an affine linear manifold with the Cartesian product of rotated quadratic cones.
Karima Tamsaouete, Baha Alzalg
doaj +1 more source
A Global Optimization Algorithm for Generalized Quadratic Programming
Journal of Applied Mathematics, 2013 We present a global optimization algorithm for solving generalized quadratic programming (GQP), that is, nonconvex quadratic programming with nonconvex quadratic constraints.
Hongwei Jiao, Yongqiang Chen
doaj +1 more source