An approximate U-Lagrangian and algorithm to UV decomposition
作者： Feng Shan , Li-Ping Pang , Zun-Quan Xia
DOI: 10.1016/J.AMC.2006.05.191
关键词:
摘要: In this paper, an concept and some properties of approximate U-Lagrangian are presented. They can be reviewed as extension to the ones U-Lagrangian. An algorithm for solving unconstrained minimization problem convergence analysis given when UV-decomposition exists.
elsevier.com
sci-hub.se 参考文章(6)
M Backmann, None, Lectu re Notes in Economics and Mathematical Systems ,(1975)
H. Attouch, A General Duality Principle for the Sum of Two Operators 1 Journal of Convex Analysis. ,vol. 3, pp. 1- 24 ,(1996)
C. Lemaréchal, J.J. Strodiot, A. Bihain, ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATION Nonlinear Programming 4#R##N#Proceedings of the Nonlinear Programming Symposium 4 Conducted by the Computer Sciences Department at the University of Wisconsin–Madison, July 14–16, 1980. pp. 245- 282 ,(1981) , 10.1016/B978-0-12-468662-5.50015-X
Michael Hintermüller, A Proximal Bundle Method Based on Approximate Subgradients Computational Optimization and Applications. ,vol. 20, pp. 245- 266 ,(2001) , 10.1023/A:1011259017643
Claude Lemaréchal, François Oustry, Claudia Sagastizábal, The -Lagrangian of a convex function Transactions of the American Mathematical Society. ,vol. 352, pp. 711- 729 ,(1999) , 10.1090/S0002-9947-99-02243-6
Dimitri Bertsekas, Nonlinear Programming ,(1995)