A Line-Search-Based Partial Proximal Alternating Directions Method for Separable Convex Optimization

馬誠韋（2002）。A Novel Approach for Resolving Multi-Objective Optimization Problems- Immune Algorithms〔碩士論文，元智大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0009-0112200611293736
Ma, F., Ni, M., Zhu, L., & Yu, Z. (2014). An Implementable First-Order Primal-Dual Algorithm for Structured Convex Optimization. Abstract and Applied Analysis, 2014(), 610-618-575. https://doi.org/10.1155/2014/396753
Tian, M., & Huang, L. H. (2014). A General Approximation Method for a Kind of Convex Optimization Problems in Hilbert Spaces. Journal of Applied Mathematics, 2014(), 733-741-064. https://doi.org/10.1155/2014/156073
Sabarinath, P., Thansekhar, M. R., & Saravanan, R. (2015). Multiobjective Optimization Method Based on Adaptive Parameter Harmony Search Algorithm. Journal of Applied Mathematics, 2015(), 44-55-004. https://doi.org/10.1155/2015/165601
STEFANOV, S. M. (2005). CONVEX SEPARABLE MINIMIZATION PROBLEMS WITH A LINEAR CONSTRAINT AND BOUNDED VARIABLES. International Journal of Mathematics and Mathematical Sciences, 2005(), 1339-1363-102. https://doi.org/10.1155/IJMMS.2005.1339