Convergence rate analysis of the proximal difference of the convex algorithm

DOI10.1155/2021/5629868MaRDI QIDQ6483801zbMATH OpenFDO

Authors Xueyong Wang, Ying Zhang, Haibin Chen, Xipeng Kou

Publication date 17 May 2021

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/5629868

Mathematics Subject Classification ID

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

Recommendations

• Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
• Convergence rates of proximal gradient methods via the convex conjugate
• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• Convergence rate of a proximal multiplier algorithm for separable convex minimization
• Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
• Convergence rate analysis of proximal gradient methods with applications to composite minimization problems
• On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
• scientific article; zbMATH DE number 1062747
• The rate of convergence of proximal method of multipliers for nonlinear programming

Cited in

(11)

• Convergence analysis of difference-of-convex algorithm with subanalytic data
• A convergence analysis for a convex version of Dikin's algorithm
• The elicited progressive decoupling algorithm: a note on the rate of convergence and a preliminary numerical experiment on the choice of parameters
• Convergence rate of a proximal multiplier algorithm for separable convex minimization
• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• Global convergence of a proximal linearized algorithm for difference of convex functions
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
• Convergence rate analysis of proximal gradient methods with applications to composite minimization problems
• Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
• An accelerated proximal algorithm for the difference of convex programming
• On the rate of convergence of the difference-of-convex algorithm (DCA)

This page was built for publication: Convergence rate analysis of the proximal difference of the convex algorithm

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