A BB-Type Algorithm for Solving Structural Combinatorial Optimization Problems
This paper proposes a BB-type algorithm for solving a class of non-smooth compound convex optimization prob-lems.Combining non-monotone line search technique and appropriate BB step size,we prove the global convergence of the pro-posed algorithm under appropriate conditions.It has been proven that the proposed algorithm has shorter CPU time,fewer iterations,and better numerical performance compared to existing algorithms.
non-smoothnon-monotonic line searchBB step sizeglobal convergence
万方数据
维普
