机译:可分离凸优化的基于路径跟随梯度的分解算法
Optimization in Engineering Center (OPTEC) and Department of Electrical Engineering, Katholieke Universiteit Leuven, Leuven, Belgium,Laboratory for Information and Inference Systems (LIONS), EPFL, Lausanne, Switzerland,Department of Mathematics-Mechanics-Informatics, Vietnam National University, Hanoi, Vietnam;
Automatic Control and Systems Engineering Department, University Politehnica Bucharest, 060042 Bucharest, Romania;
Optimization in Engineering Center (OPTEC) and Department of Electrical Engineering, Katholieke Universiteit Leuven, Leuven, Belgium;
Path-following gradient method; Dual fast gradient algorithm; Separable convex optimization; Smoothing technique; Self-concordant barrier; Parallel implementation;
机译:大规模可分离凸优化中拉格朗日分解的不精确扰动路径跟踪方法
机译:用于大规模可分离凸优化的快速不精确分解算法
机译:线性约束凸优化的一种新的对偶路径跟随内点算法
机译:带有完整Nesterov-Todd步骤的凸二次半定优化的新的原始-对偶路径跟踪内点算法
机译:凸二次规划的不可行路径跟踪算法。
机译:线性约束两块可分离凸优化问题的近交交替最小化算法
机译:基于路径跟踪的可分离算法的分解算法 凸优化