115 search results - page 1 / 23 » On the LVI-based numerical method (E47 algorithm) for solvin... |
ICAL
2011
12 years 3 months ago
2011
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
CVPR
2007
IEEE
14 years 6 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
OL
2007
13 years 3 months ago
2007
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
OL
2011
12 years 11 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...