A Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization

Yuan Lu, Wei Wang, Li-Ping Pang and Dan Li

Abstract and Applied Analysis, 2013, vol. 2013, issue 1

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

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2013/376403

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2013:y:2013:i:1:n:376403

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().