A Boosted-DCA with Power-Sum-DC Decomposition for Linearly Constrained Polynomial Programs

Hu Zhang and Yi-Shuai Niu ()
Additional contact information
Hu Zhang: Shanghai Jiao Tong University
Yi-Shuai Niu: Beijing Institute of Mathematical Sciences and Applications

Journal of Optimization Theory and Applications, 2024, vol. 201, issue 2, No 9, 720-759

Abstract: Abstract This paper proposes a novel Difference-of-Convex (DC) decomposition for polynomials using a power-sum representation, achieved by solving a sparse linear system. We introduce the Boosted DCA with Exact Line Search ( $$\hbox {BDCA}_\text {e}$$ BDCA e ) for addressing linearly constrained polynomial programs within the DC framework. Notably, we demonstrate that the exact line search equates to determining the roots of a univariate polynomial in an interval, with coefficients being computed explicitly based on the power-sum DC decompositions. The subsequential convergence of $$\hbox {BDCA}_\text {e}$$ BDCA e to critical points is proven, and its convergence rate under the Kurdyka–Łojasiewicz property is established. To efficiently tackle the convex subproblems, we integrate the Fast Dual Proximal Gradient method by exploiting the separable block structure of the power-sum DC decompositions. We validate our approach through numerical experiments on the Mean–Variance–Skewness–Kurtosis portfolio optimization model and box-constrained polynomial optimization problems. Comparative analysis of $$\hbox {BDCA}_\text {e}$$ BDCA e against DCA, BDCA with Armijo line search, UDCA, and UBDCA with projective DC decomposition, alongside standard nonlinear optimization solvers FMINCON and FILTERSD, substantiates the efficiency of our proposed approach.

Keywords: Power-sum DC decomposition; Polynomial optimization; Boosted DCA with exact line search; FDGP method; Portfolio optimization; 90C26; 90C30; 91G10 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-024-02414-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:joptap:v:201:y:2024:i:2:d:10.1007_s10957-024-02414-5

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-024-02414-5

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().