Please use this identifier to cite or link to this item:
|Title:||Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms|
Sum of norms
|Source:||Zhou, G., Toh, K.C., Sun, D. (2003-11). Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms. Journal of Optimization Theory and Applications 119 (2) : 357-377. ScholarBank@NUS Repository. https://doi.org/10.1023/B:JOTA.0000005450.58251.6d|
|Abstract:||For the problem of minimizing the sum of Euclidean norms (MSN), most existing quadratically convergent algorithms require a strict complementarity assumption. However, this assumption is not satisfied for a number of MSN problems. In this paper, we present a globally and quadratically convergent algorithm for the MSN problem. In particular, the quadratic convergence result is obtained without assuming strict complementarity. Examples without strictly complementary solutions are given to show that our algorithm can indeed achieve quadratic convergence. Preliminary numerical results are reported.|
|Source Title:||Journal of Optimization Theory and Applications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 15, 2018
WEB OF SCIENCETM
checked on Jan 30, 2018
checked on Feb 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.