86 search results - page 3 / 18 » Non-convex quadratic minimization problems with quadratic co... |
84
Voted
MA
2011
Springer
14 years 5 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...
105
Voted
ICASSP
2011
IEEE
14 years 2 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...
94
Voted
SIAMSC
2008
14 years 10 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...
92
Voted
ICASSP
2010
IEEE
14 years 10 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...
112
Voted
MP
2002
14 years 10 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...