期刊文献+

ON THE CONVERGENCE OF AN APPROXIMATE PROXIMAL METHOD FOR DC FUNCTIONS

ON THE CONVERGENCE OF AN APPROXIMATE PROXIMAL METHOD FOR DC FUNCTIONS
原文传递
导出
摘要 In this paper we prove the convergence of the approximate proximal method for DC functions proposed by Sun et al [6]. Our analysis also permits to treat the exact method. We then propose an interesting result in the case where the second component of the DC function is differentiable and provide some computational experiences which proved the efficiency of our method. In this paper we prove the convergence of the approximate proximal method for DC functions proposed by Sun et al [6]. Our analysis also permits to treat the exact method. We then propose an interesting result in the case where the second component of the DC function is differentiable and provide some computational experiences which proved the efficiency of our method.
出处 《Journal of Computational Mathematics》 SCIE CSCD 2006年第4期475-480,共6页 计算数学(英文)
关键词 DC minimization Critical points SUBDIFFERENTIALS Proximal mappings. DC minimization, Critical points, Subdifferentials, Proximal mappings.
  • 相关文献

参考文献1

二级参考文献25

  • 1J B Hiriart-Urruty. From convex optimization to nonconvex optimization, necessary and sufficient conditions for global optimization, Nonsmooth Optimization and Related Topics, Plenum Press,(1989), 219-240.
  • 2J B Hiriart-Urruty. Generalized differenciability, duality and optimization for problems dealing with difference of convex functions, Convexity and Duality in Optimization, Lecture Notes in Economics And Mathematical Systems 256, (1986), 37-70.
  • 3J B Hiriart-Urruty and H Tuy. Essays on nonconvex optimization, Mthematical Programming,41 (1988).
  • 4J B Hiriart-Urruty and C Lemarechal. Convex Analysis and Minimization Algorithms II, Sringer-Verlag, Berlin, (1993).
  • 5K C Kiwiel. Proximity control in bundle methods for convex non-differentiable minimization,Mathematical Programming, 46 (1990), 105-122.
  • 6H Mine and M Fukushima. A minimization method for the sum of a convex function and a continuously differentiable function, J Optimization Theory and Applications, 33 (1981), 9-23.
  • 7J S Pang and L Qi. Nonsmooth equations: motivation and algorithms, SIAM J. Optimization, 3(1993), 443-465.
  • 8D T Pham and E B Souad. Algorithms for solving a class of nonconvex optimizations problems:methods of subgradient, Fermat Days 85: Mathematics for Optimization, North Holland, (1986).
  • 9L Qi, Convergence analysis of some algorithms for solving nonsmooth equations, Mathematics of Operations Research, 18 (1993), 227-244.
  • 10L Qi and W Sun. An iterative method for minimax problem, in D.Z.Du and P.M.Pardalos eds.,Minimax and Applications, (Kluwer Academic Publisher, New York, 1995), 55-67.

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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