A Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization
Joint Authors
Wang, Wei
Lu, Yuan
Li, Dan
Pang, Li-Ping
Source
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-02-26
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract 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.
American Psychological Association (APA)
Lu, Yuan& Wang, Wei& Pang, Li-Ping& Li, Dan. 2013. A Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization. Abstract and Applied Analysis،Vol. 2013, no. 2013, pp.1-9.
https://search.emarefa.net/detail/BIM-467234
Modern Language Association (MLA)
Lu, Yuan…[et al.]. A Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization. Abstract and Applied Analysis No. 2013 (2013), pp.1-9.
https://search.emarefa.net/detail/BIM-467234
American Medical Association (AMA)
Lu, Yuan& Wang, Wei& Pang, Li-Ping& Li, Dan. A Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization. Abstract and Applied Analysis. 2013. Vol. 2013, no. 2013, pp.1-9.
https://search.emarefa.net/detail/BIM-467234
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-467234
