Mean-variance portfolio optimal problem under concave transaction cost
暂无分享,去创建一个
[1] Le Thi Hoai An,et al. Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems , 1995, Oper. Res. Lett..
[2] H. Tuy. Convex analysis and global optimization , 1998 .
[3] R. Horst,et al. Global Optimization: Deterministic Approaches , 1992 .
[4] Reiner Horst,et al. Introduction to Global Optimization (Nonconvex Optimization and Its Applications) , 2002 .
[5] P. T. Thach,et al. Optimization on Low Rank Nonconvex Structures , 1996 .
[6] Fengmin Xu,et al. A BRANCH AND BOUND ALGORITHM FOR SEPARABLE CONCAVE PROGRAMMING ∗1) , 2004 .
[7] Panos M. Pardalos,et al. Introduction to Global Optimization , 2000, Introduction to Global Optimization.
[8] Hiroshi Konno,et al. Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints , 2001, Math. Program..
[9] J. E. Falk,et al. An Algorithm for Separable Nonconvex Programming Problems , 1969 .
[10] Xu Chengxian,et al. A branch and bound algorithm for solving a class of D-C programming , 2005 .
[11] Hong-gangXue,et al. A BRANCH AND BOUND ALGORITHM FOR SEPARABLE CONCAVE PROGRAMMING , 2004 .
[12] P. Krokhmal,et al. Portfolio optimization with conditional value-at-risk objective and constraints , 2001 .