Convex optimisation constitutes a fundamental area in applied mathematics where the objective is to identify the minimum of a convex function subject to a set of convex constraints. This framework ...
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 ...
Vol. 11, No. 3, Special Issue of the International Symposium on Nonlinear Analysis and Convex Analysis 2006 (August 2007), pp. 883-902 (20 pages) Published By: Mathematical Society of the Republic of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback