Results 1 to 10 of about 31,007 (299)
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
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
On the complexity of quadratic programming with two quadratic constraints [PDF]
Mathematical Programming, 2016 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.
Luca Consolini, Marco Locatelli 0001
openaire +4 more sources
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 +2 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
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 +2 more sources
Preprocessing for quadratic programming [PDF]
Mathematical Programming, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nick I. M. Gould, Philippe L. Toint
openaire +3 more sources
On Linear and Quadratic Two-Stage Transportation Problem
Кібернетика та комп'ютерні технології, 2020 Introduction. When formulating the classical two-stage transportation problem, it is assumed that the product is transported from suppliers to consumers through intermediate points.
Petro Stetsyuk +2 more
doaj +1 more source
Approximating sparse quadratic programs
Theoretical Computer Science, 2022 Given a matrix $A \in \mathbb{R}^{n\times n}$, we consider the problem of maximizing $x^TAx$ subject to the constraint $x \in \{-1,1\}^n$. This problem, called MaxQP by Charikar and Wirth [FOCS'04], generalizes MaxCut and has natural applications in data clustering and in the study of disordered magnetic phases of matter. Charikar and Wirth showed that
Danny Hermelin +3 more
openaire +3 more sources