Results 1 to 10 of about 6,923,236 (207)
Fast approximate quadratic programming for graph matching. [PDF]
PLoS ONE, 2015 Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few.
Joshua T Vogelstein +8 more
doaj +3 more sources
Vertical Jumping for Legged Robot Based on Quadratic Programming [PDF]
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 +2 more sources
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs [PDF]
, 2011 We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained quadratic problems. Classes of valid linear inequalities are presented, including sparse PSD cuts, and principal minors PSD ...
Belotti, Pietro +2 more
core +4 more sources
Quadratic programming is in NP [PDF]
Information Processing Letters, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stephen A Vavasis
exaly +2 more sources
On the Sequential Quadratically Constrained Quadratic Programming Methods [PDF]
Mathematics of Operations Research, 2004 An iteration of the sequential quadratically constrained quadratic programming method (SQCQP) consists of minimizing a quadratic approximation of the objective function subject to quadratic approximation of the constraints, followed by a line search in the obtained direction.
M V Solodov
exaly +2 more sources
HPU2 Journal of Science: Natural Sciences and TechnologyThis survey provides a systematic review of quadratic programming (QP) and quadratically constrained quadratic programming (QCQP) problems. The paper reviews mathematical formulations and problem taxonomies based on convexity properties, surveys ...
Kim-Thuy Dinh Thi
semanticscholar +2 more sources
Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization. [PDF]
Numer Math (Heidelb), 2017 Interior point methods provide an attractive class of approaches for solving linear, quadratic and nonlinear programming problems, due to their excellent efficiency and wide applicability.
Pearson JW, Gondzio J.
europepmc +4 more sources
An accelerating algorithm for globally solving nonconvex quadratic programming [PDF]
Journal of Inequalities and Applications, 2018 To globally solve a nonconvex quadratic programming problem, this paper presents an accelerating linearizing algorithm based on the framework of the branch-and-bound method. By utilizing a new linear relaxation approach, the initial quadratic programming
Li Ge, Sanyang Liu
doaj +2 more sources
Mixed-integer Quadratic Programming is in NP [PDF]
Mathematical programming, 2014 Mixed-integer quadratic programming is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In this paper, we prove that the decision version of mixed-integer quadratic
Del Pia, Alberto +2 more
core +2 more sources
On the complexity of quadratic programming with two quadratic constraints
Mathematical Programming, 2017 This paper deals with problems of the form \[ \begin{aligned} \min & \frac{1}{2}x^{T}Qx+q^{T}x \\ \text{s.t.} & \frac{1}{2}x^{T}x\leq \frac{1}{2} \\ & \frac{1}{2}x^{T}Ax+a^{T}x\geq u, \end{aligned} \tag{1} \] where \(A\) is a positive definite \(n\times n\) symmetric matrix.
L. Consolini, M. Locatelli
semanticscholar +4 more sources