86 search results - page 3 / 18 » Non-convex quadratic minimization problems with quadratic co... |
MA
2011
Springer
13 years 2 months ago
2011
Springer
We consider the problem minx(x−t) A(x−t) subject to x Bx + 2b x = k where A is positive definite or positive semidefinite. Commonly occurring statistical variants of this pro...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
SIAMSC
2008
13 years 7 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
This paper considers two problems in sparse filter design, the first involving a least-squares constraint on the frequency response, and the second a constraint on signal-to-noi...
MP
2002
13 years 7 months ago
2002
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...