摘要
In this paper, we present a homotopy continuation method for a class of large constraints convex programming problems. The first step, the constraints are ap-proximated by a family of smooth aggregate constraints, the second step, we con-struct a homotopy method for globally finding convex programming problems with one constraint.
In this paper, we present a homotopy continuation method for a class of large constraints convex programming problems. The first step, the constraints are ap-proximated by a family of smooth aggregate constraints, the second step, we con-struct a homotopy method for globally finding convex programming problems with one constraint.
出处
《计算数学》
CSCD
北大核心
1999年第3期309-316,共8页
Mathematica Numerica Sinica
基金
国家自然科学基金
