A general double-proximal gradient algorithm for d.c. programming

DOI10.1007/s10107-018-1292-2zbMath1423.90195arXiv1610.06538OpenAlexW2963529998WikidataQ91426055 ScholiaQ91426055MaRDI QIDQ2330650

Sebastian Banert, Radu Ioan Boţ

Publication date: 22 October 2019

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.06538

zbMATH Keywords

convergence analysisd.c. programmingKurdyka-Łojasiewicz propertyproximal-gradient algorithmToland dual

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods involving duality (49M29)

Related Items (10)

The ABC of DC programming ⋮ Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems ⋮ Calculus rules of the generalized concave Kurdyka-Łojasiewicz property ⋮ Variational models for color image correction inspired by visual perception and neuroscience ⋮ A proximal difference-of-convex algorithm with extrapolation ⋮ A bundle method for nonsmooth DC programming with application to chance-constrained problems ⋮ The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions ⋮ A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems ⋮ The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property ⋮ An extension of the proximal point algorithm beyond convexity

Uses Software

• iPiano

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• DCA based algorithms for feature selection in multi-class support vector machine
• Some sharp performance bounds for least squares regression with \(L_1\) regularization
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Duality in nonconvex optimization
• A duality principle for non-convex optimisation and the calculus of variations
• On gradients of functions definable in o-minimal structures
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Introductory lectures on convex optimization. A basic course.
• A fast dual proximal gradient algorithm for convex minimization and applications
• Accelerating the DC algorithm for smooth functions
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• DC programming: overview.
• Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization
• iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
• Computing B-Stationary Points of Nonsmooth DC Programs
• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
• Convergence of New Inertial Proximal Methods for DC Programming
• Variational Analysis
• Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
• Some methods of speeding up the convergence of iteration methods
• Convex Analysis
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: A general double-proximal gradient algorithm for d.c. programming