A forward-backward algorithm for the DC programming in Hilbert spaces

DOI10.23952/JNVA.3.2019.2.06MaRDI QIDQ5244142zbMATH OpenOpenAlexFDO

Authors Chih-Sheng Chuang

Publication date 20 November 2019

Published in Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.23952/jnva.3.2019.2.06

zbMATH Keywords

DC programmingstrongly convexmaximal monotonesemicontinuous and convex function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces
• Hybrid proximal linearized algorithm for the split generalized DC programming
• A double forward-backward algorithm using linesearches for minimization problem
• Backward-forward algorithms for structured monotone inclusions in Hilbert spaces
• A unified Douglas-Rachford algorithm for generalized DC programming

Cites work

• scientific article; zbMATH DE number 2076851 (Why is no real title available?)
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A fast quadratic programming algorithm for positive signal restoration
• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• Convergence of New Inertial Proximal Methods for DC Programming
• Convex analysis and monotone operator theory in Hilbert spaces
• Extended Farkas lemma and strong duality for composite optimization problems with DC functions
• Extended Farkas's lemmas and strong Lagrange dualities for DC infinite programming
• Global convergence of a proximal linearized algorithm for difference of convex functions
• Lagrange duality in canonical DC programming
• Lagrange-type duality in DC programming
• Local and global optimality conditions for dc infinite optimization problems
• Optimality conditions for DC programming problems with reverse convex constraints
• Optimality conditions for convex and DC infinite optimization problems
• Signal Recovery by Proximal Forward-Backward Splitting
• Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
• Totally convex functions for fixed points computation and infinite dimensional optimization

Cited in

(3)

• Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces
• A unified Douglas-Rachford algorithm for generalized DC programming
• Hybrid proximal linearized algorithm for the split generalized DC programming

This page was built for publication: A forward-backward algorithm for the DC programming in Hilbert spaces

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