• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Projected Newton Method for L/sub p/ Norm Location Problems
【24h】

Projected Newton Method for L/sub p/ Norm Location Problems

机译：L / sub p / Norm定位问题的投影牛顿法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper is concerned with the numerical solution of continuous minisum multifacility location problems involving the l/sub p/ norm, where 1 < p < infinity. This class of problems is potentially difficult to solve because the objective function is not everywhere differentiable. After developing conditions that characterize the minimum of the problems under consideration, a second-order algorithm is presented. This algorithm is based on the solution of a finite sequence of linearly constrained subproblems. Descent directions for these subproblems are obtained by projecting the Newton direction onto the corresponding constraint manifold. Univariate minimization is achieved via a specialized linesearch which recognizes the possibility of first derivative discontinuity (and second derivative unboundedness) at points along the search direction. The algorithm, motivated by Calamai and Calamai and Conn and related to methods recently described by Overton and Dax, is shown to possess both global and quadratic convergence properties. Degeneracy can complicate the numerical solution of the subproblems. This degeneracy is identified, and a method for handling this degeneracy is outlined. An implementation of the algorithm, that exploits the intrinsic structure of the location problem formulation, is then described along with a discussion of numerical results. 35 refs., 7 tabs. (ERA citation 11:006697)

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号