On convex envelopes and regularization of non-convex functionals without moving global minima
From MaRDI portal
Publication:2275270
DOI10.1007/s10957-019-01541-8zbMath1425.49013arXiv1811.03439OpenAlexW2963422483MaRDI QIDQ2275270
Publication date: 2 October 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.03439
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Numerical methods of relaxation type (49M20)
Related Items
An Unbiased Approach to Low Rank Recovery, Bias versus non-convexity in compressed sensing, New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem, An unbiased approach to compressed sensing, Compensated convexity on bounded domains, mixed Moreau envelopes and computational methods, A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem, On phase retrieval via matrix completion and the estimation of low rank PSD matrices, Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition, A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix, Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions, Learnable Empirical Mode Decomposition based on Mathematical Morphology
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Approximation and regularization of arbitrary functions in Hilbert spaces by the Lasry-Lions method
- Symbolic Fenchel conjugation
- Computing proximal points of nonconvex functions
- A remark on regularization in Hilbert spaces
- Convex envelopes for fixed rank approximation
- Convex envelopes for edge-concave functions
- On regularization in Banach spaces
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Fixed-point algorithms for frequency estimation and structured low rank approximation
- Convex low rank approximation
- Konjugierte Funktionen
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Atomic Decomposition by Basis Pursuit
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- A Proximal Average for Nonconvex Functions: A Proximal Stability Perspective
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications
- The Proximal Average: Basic Theory
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Approximated Convex Envelope of a Function
- Variational Analysis
- Subgradient monotonicity and convex functions
- An unbiased approach to compressed sensing
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Stable signal recovery from incomplete and inaccurate measurements
- Milman's Theorem for Convex Functions.
- Convex analysis and monotone operator theory in Hilbert spaces
