A Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization

الملخص EN

A class of constrained nonsmooth nonconvex optimization problems, that is, piecewise C2 objectives with smooth inequality constraints are discussed in this paper.

Based on the ??-theory, a superlinear convergent ??-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.