期刊文献+

极小化r个最大函数和的一阶光滑化方法 被引量:1

First-order smoothing method for minimizing the sum of the r-largest functions
下载PDF
导出
摘要 研究如下问题:已给m个定义在n维欧几里?空间的函数,在这m个函数中求r个最大值函数的最小值,其中1≤r≤m.显然,该问题是非光滑最优化问题,不能直接用一阶最优化方法或梯度法来求解.将此问题转化为只包含最大值函数m ax{0,t}的非光滑问题,对该非光滑问题提出了一种收敛的一阶光滑化算法. To a collection of m functions defined on R^n, the minimal value of the r ( 1 ≤ r ≤ m) largest functions is need to be found . It is obvious that this problem is nonsmooth optimization problem, and it cannot be solved using any first-order or gradient unconstrained minimization algorithms. In this paper, the problem is reformulated as a nonsmooth problem that involves only the maximum function max {0, t}. In order to solve nonsmooth problem, a new convergent first-order smoothing method is developed.
作者 刘三明
出处 《江苏科技大学学报(自然科学版)》 CAS 北大核心 2008年第6期87-90,共4页 Journal of Jiangsu University of Science and Technology:Natural Science Edition
关键词 r个最大函数和 非光滑问题 一阶光滑化法 sum of the r-largest functions nonsmooth problem the first-order smoothing method
  • 相关文献

参考文献8

  • 1[1]Slater P J.Centers to centroids in a graph[J].Journal of Graph Theory,1978(2):209-222.
  • 2[2]Andreatta G,Mason F M.K-eccentricity and absolute k-centrum of a tree[J].European Journal of Operations Research,1985,19:114-117.
  • 3[3]Andreatta G,Mason F M.Properties of k-centrum in anetwork[J].Networks,1985,15:21-25.
  • 4[4]Ogryczak W,Zawadzki M.Conditional median:a parametric solution concept for location problem[J].Annals of Operations Research,2002,110:167-181.
  • 5[5]Tamir A.The k-centrum multi-facility location problem[J].Disrecte Applied Mathematics,2001,109:293-307.
  • 6[6]Ogryczak W,Tamir A.Minimizing the sum of the k largest functions in linear time[J].Information Processing Letters,2002,85:117-122.
  • 7[7]Pan S H,Li Xingsi.An efficient algorithm for the Euclidean r-centrum location problem[J].Applied Mathematics and Computation,2005,167:716-728.
  • 8[8]Pan S H,Li Xingsi.A smoothing method for minimizing the sun of the r largest functions[J].Optimization Methods and Software,2007,22:267-277.

同被引文献14

  • 1Slater P J. Centers to centroids in graphs[J]. Jour nal of Graph Theory, 1978,2(3) : 209-222.
  • 2Andreatta G, Mason F M. K-eccentricity and absolute k-centrum of a probabilistic tree[J]. European Journal of Operational Research, 1985,19(1) : 114-117.
  • 3Andreatta G, Mason F M. Properties of the k-centra in a tree network[J].Networks, 1985 15(1) :21-25.
  • 4Ogryczak W, Zawadzki M. Conditional median: a parametric solution concept for location problems [J]. Annals of Operations Research, 2002,110(1/ 4) :167-181.
  • 5Blanco V, E1-Haj Ben-Ali S, Puert J. A semidefi- nite Programming approach for minimizing ordered weighted averages of rational functions [EB/OL].(2011-06 28)L2011-O9-OSJ. http://arxiv, org/abs/ 1106.2407.
  • 6Tamir A. The k-centrum multi-facility location pro blem[J].Discrete Applied Mathematics, 2001 109:293 307.
  • 7Kazuki T, Yoshiaki O, Hiroshi K, et al. An opti mal location of k-centrum problems in a planar space[J]. Theory and Applications of GIS, 2009, 17(1): 101-110.
  • 8Ohsawa Y, Ozaki N, Plastria F, et al. Quadratic ordered median location problems [J].Journal of the Operations Research Society of Japan, 2007,50 (4) : 540-562.
  • 9Pan Shaohua, Li Xingsi. An efficient algorithm for the Euclidean r-centrum location problem [J].Applied Mathematics and Computation, 2005,167 (1) : 716- 728.
  • 10Pan Shaohua, Chen Jinshan. Two unconstrained optimization approaches for the Euclidean k-cen- trum location problem[J]. Applied Mathematics and Computation, 2007,189(2) :1368-1383.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部