A Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization. (26th February 2013)

• Record Type: Journal Article
• Authors: Lu, Yuan; Wang, Wei; Pang, Li-Ping; Li, Dan
• Other Names: Combes Jean M. Academic Editor.
• Is Part Of: Abstract and applied analysis. Volume 2013(2013)
• Publication Date: 2013-02-26
• Subjects: Mathematical analysis -- Periodicals; Mathematical analysis; Applied Mathematics; Mathematical Analysis; Periodicals; 515.05
• DOI: 10.1155/2013/376403
• Languages: English
• ISSNs: 1085-3375

Abstract

Abstract : 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 𝒱 𝒰 -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.