First-order primal-dual methods for nonsmooth non-convex optimization

DOI10.1007/978-3-030-98661-2_93zbMATH Open1547.9016MaRDI QIDQ6606458

Tuomo Valkonen

Publication date: 16 September 2024

zbMATH Keywords

nonsmooth optimizationinverse problemsnonconvex optimizationprimal-dual methods

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Convex analysis and optimization in Hadamard spaces
• First-Order Methods in Optimization
• Optical Imaging
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• Convex analysis and monotone operator theory in Hilbert spaces

Related Items (1)

A general solution to the quasi linear screening problem

This page was built for publication: First-order primal-dual methods for nonsmooth non-convex optimization

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