A variant of the augmented Lagrangian-type algorithm for strictly convex quadratic programming problems with bounds and equality constraints is considered. The algorithm exploits the adaptive ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback