首页 | 本学科首页   官方微博 | 高级检索  
     


The Newton Bracketing Method for Convex Minimization
Authors:Yuri Levin  Adi Ben-Israel
Affiliation:(1) Rutcor–Rutgers Center for Operations Research, Rutgers University, 640 Bartholomew Rd, Piscataway, NJ 08854-8003, USA
Abstract:An iterative method for the minimization of convex functions f :Ropfn rarr Ropf, called a Newton Bracketing (NB) method, is presented. The NB method proceeds by using Newton iterations to improve upper and lower bounds on the minimum value. The NB method is valid for n = 1, and in some cases for n > 1 (sufficient conditions given here). The NB method is applied to large scale Fermat–Weber location problems.
Keywords:directional Newton method  convex functions  unconstrained minimization  Fermat–  Weber location problem
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号