Exact Lipschitz regularization of convex optimization problems

DOI10.1007/S10957-024-02465-8MaRDI QIDQ6655789

Marc Teboulle, Amir Beck

Publication date: 27 December 2024

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

convex optimizationLipschitz regularizationcomposite modelPasch-Hausdorff envelope

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Calculus of variations and optimal control; optimization (49-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Smooth minimization of non-smooth functions
• Adaptive smoothing algorithms for nonsmooth composite convex minimization
• Über halbstetige Funktionen und deren Verallgemeinerung.
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Variable smoothing for convex optimization problems using stochastic gradients
• On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
• Smoothing and first order methods: a unified framework
• Exact penalty functions in nonlinear programming
• First-Order Methods in Optimization
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
• Faster Lagrangian-Based Methods in Convex Optimization
• Proximité et dualité dans un espace hilbertien
• Convex Analysis
• Minimization of unsmooth functionals
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Exact Lipschitz regularization of convex optimization problems

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