首页> 外文期刊>Pacific Journal of Optimization >A SEMISMOOTH NEWTON BASED AUGMENTED LAGRANGIAN ALGORITHM FOR WEBER PROBLEM
【24h】

A SEMISMOOTH NEWTON BASED AUGMENTED LAGRANGIAN ALGORITHM FOR WEBER PROBLEM

机译:A SEMISMOOTH NEWTON BASED AUGMENTED LAGRANGIAN ALGORITHM FOR WEBER PROBLEM

获取原文
获取原文并翻译 | 示例
           

摘要

This paper is concerned with efficient algorithms for solving Weber problem, which is an important problem arising in the facility location problems. In this paper, we reformulate the Weber problem as its equivalent form and then propose a semismooth Newton based augmented Lagrangian (SSNAL) algorithm for solving Weber problem. The global convergence and locally asymptotically superlinear convergence of the SSNAL algorithm are characterized under mild conditions. Numerical experiments conducted on synthetic data sets demonstrate that the SSNAL algorithm outperforms several state-of-the-art algorithms in terms of efficiency and robustness.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号