Bregman distance regularization for nonsmooth and nonconvex optimization

DOI10.4153/s0008439523000851MaRDI QIDQ6634712

Zeinab Mashreghi, Mostafa Nasri

Publication date: 8 November 2024

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

zbMATH Keywords

nonsmooth optimizationnonconvex optimizationlocal minimizerBregman distancelasso regression model

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

• Unnamed Item
• Unnamed Item
• Proximal minimization algorithm with \(D\)-functions
• Totally convex functions for fixed points computation and infinite dimensional optimization
• Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization
• Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization
• Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
• Clarke Subgradients of Stratifiable Functions
• Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
• Sparse Regularization via Convex Analysis
• Entropy-Like Proximal Methods in Convex Programming
• Non-convex Optimization via Strongly Convex Majorization-minimization
• A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization

This page was built for publication: Bregman distance regularization for nonsmooth and nonconvex optimization