English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We are interested in solving the Asymmetric Eigenvalue ComplementarityProblem (AEiCP) by accelerated Difference-of-Convex (DC) algorithms. Two novelhybrid accelerated DCA: the Hybrid DCA with Line search and Inertial force(HDCA-LI) and the Hybrid DCA with Nesterov's extrapolation and Inertial force(HDCA-NI), are established. We proposed three DC programming formulations ofAEiCP based on Difference-of-Convex-Sums-of-Squares (DC-SOS) decompositiontechniques, and applied the classical DCA and 6 accelerated variants (BDCA withexact and inexact line search, ADCA, InDCA, HDCA-LI and HDCA-NI) to the threeDC formulations. Numerical simulations of 7 DCA-type methods againststate-of-the-art optimization solvers IPOPT, KNITRO and FILTERSD, are reported.

Accelerated DC Algorithms for the Asymmetric Eigenvalue Complementarity Problem