A Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization
Keyword(s):
A class of constrained nonsmooth nonconvex optimization problems, that is, piecewiseC2objectives 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.
2020 ◽
Vol 31
(5)
◽
pp. 1475-1488
2011 ◽
Vol 21
(2)
◽
pp. 317-329
◽
2010 ◽
Vol 31
(2)
◽
pp. 263-270
◽
2018 ◽
Vol 28
(2)
◽
pp. 1640-1669
◽
2014 ◽
Vol 163
(3)
◽
pp. 697-706
◽
2009 ◽
Vol 20
(6)
◽
pp. 1024-1038
◽