科研之友
微信
新浪微博
Facebook
分享链接
摘要
A class of constrained nonsmooth nonconvex optimization problems, that is, piecewise C-2 objectives with smooth inequality constraints are discussed in this paper. Based on the VU-theory, a superlinear convergent VU-algorithm, which uses a nonconvex redistributed proximal bundle subroutine, is designed to solve these optimization problems. An illustrative example is given to show how this convergent method works on a Second-Order Cone programming problem.
