86 search results - page 1 / 18 » Non-convex quadratic minimization problems with quadratic co... |
SIAMJO
2008
13 years 4 months ago
2008
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
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 ...
MCS
2008
Springer
13 years 4 months ago
2008
Springer
We investigate optimal control problems subject to mixed control-state constraints. The necessary conditions are stated in terms of a local minimum principle. By use of the Fischer...
ICPR
2008
IEEE
14 years 5 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...