Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A globally convergent algorithm for the Euclidean multiplicity location problem

A globally convergent algorithm for the Euclidean multiplicity location problem The Euclidean single facility location problem (ESFL) and the Euclidean multiplicity location problem (EMFL) are two special nonsmooth convex programming problems which have attracted a large literature. For the ESFL problem, there are algorithms which converge both globally and quadratically. For the EMFL problem, there are some quadratically convergent algorithms, but for global convergence, they all need nontrivial assumptions on the problem. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

A globally convergent algorithm for the Euclidean multiplicity location problem

Loading next page...
 
/lp/springer-journals/a-globally-convergent-algorithm-for-the-euclidean-multiplicity-jzbyKRV5Gp
Publisher
Springer Journals
Copyright
Copyright © 1992 by Science Press, Beijing, China and Allerton Press, Inc., New York, U.S.A.
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02006744
Publisher site
See Article on Publisher Site

Abstract

The Euclidean single facility location problem (ESFL) and the Euclidean multiplicity location problem (EMFL) are two special nonsmooth convex programming problems which have attracted a large literature. For the ESFL problem, there are algorithms which converge both globally and quadratically. For the EMFL problem, there are some quadratically convergent algorithms, but for global convergence, they all need nontrivial assumptions on the problem.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Jul 13, 2005

References