A primal-dual algorithm for minimizing a sum of Euclidean norms

Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0377-0427(01)00357-0

Title:	A primal-dual algorithm for minimizing a sum of Euclidean norms
Authors:	Qi, L. Sun, D. Zhou, G.
Keywords:	Euclidean facilities location Prima-dual algorithm Semismooth Steiner minimum trees Sum of norms VLSL design
Issue Date:	1-Jan-2002
Citation:	Qi, L., Sun, D., Zhou, G. (2002-01-01). A primal-dual algorithm for minimizing a sum of Euclidean norms. Journal of Computational and Applied Mathematics 138 (1) : 127-150. ScholarBank@NUS Repository. https://doi.org/10.1016/S0377-0427(01)00357-0
Abstract:	We study the problem of minimizing a sum of Euclidean norms. This nonsmooth optimization problem arises in many different kinds of modern scientific applications. In this paper we first transform this problem and its dual problem into a system of strongly semismooth equations, and give some uniqueness theorems for this problem. We then present a primal-dual algorithm for this problem by solving this system of strongly semismooth equations. Preliminary numerical results are reported, which show that this primal-dual algorithm is very promising. © 2002 Elsevier Science B.V. All rights reserved.
Source Title:	Journal of Computational and Applied Mathematics
URI:	http://scholarbank.nus.edu.sg/handle/10635/102734
ISSN:	03770427
DOI:	10.1016/S0377-0427(01)00357-0
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check