An accelerated proximal algorithm for the difference of convex programming

DOI10.1155/2021/9994015MaRDI QIDQ6484353zbMATH OpenFDO

Authors Feichao Shen, Ying Zhang, Xueyong Wang

Publication date 24 January 2022

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2021/9994015

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52)

Recommendations

• A proximal difference-of-convex algorithm with extrapolation
• Convergence rate analysis of the proximal difference of the convex algorithm
• New Bregman proximal type algoritms for solving DC optimization problems
• A new boosted proximal point algorithm for minimizing nonsmooth DC functions
• The modified second APG method for DC optimization problems

Cited in

(21)

• New Bregman proximal type algoritms for solving DC optimization problems
• A unified Douglas-Rachford algorithm for generalized DC programming
• A proximal difference-of-convex algorithm with extrapolation
• An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
• Accelerating the DC algorithm for smooth functions
• Double-inertial proximal gradient algorithm for difference-of-convex programming
• Applications of the proximal difference-of-convex algorithm with extrapolation in optimal correction
• On the rate of convergence of the difference-of-convex algorithm (DCA)
• Sequential difference-of-convex programming
• A general double-proximal gradient algorithm for d.c. programming
• Fast proximity-gradient algorithms for structured convex optimization problems
• A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program
• Extra-gradient linearized algorithms and Tseng's linearized algorithm for the split DC programming
• A new boosted proximal point algorithm for minimizing nonsmooth DC functions
• Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
• Global convergence of a proximal linearized algorithm for difference of convex functions
• Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
• Split proximal linearized algorithm and convergence theorems for the split DC program
• Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity
• The modified second APG method for DC optimization problems
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions

This page was built for publication: An accelerated proximal algorithm for the difference of convex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6484353)