Solution uniqueness of convex optimization problems via the radial cone
From MaRDI portal
Cites work
- A mathematical introduction to compressive sensing
- A unified approach to error bounds for structured convex optimization problems
- Characterization of metric regularity of subdifferentials
- Characterization of the subdifferential of some matrix norms
- Convex Analysis
- Decoding by Linear Programming
- Exact matrix completion via convex optimization
- From error bounds to the complexity of first-order descent methods for convex functions
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 176973 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems
- Linear convergence rates for Tikhonov regularization with positively homogeneous functionals
- Living on the edge: phase transitions in convex programs with random data
- Matrix Analysis
- Necessary and sufficient conditions for linear convergence of ^1-regularization
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- Nonsmooth analysis of singular values. I: Theory
- Nonsmooth analysis of singular values. II: Applications
- On solution uniqueness and robust recovery for sparse regularization with a gauge: from dual point of view
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
- One condition for solution uniqueness and robustness of both _1-synthesis and _1-analysis minimizations
- Partial Smoothness, Tilt Stability, and Generalized Hessians
- Quadratic growth conditions and uniqueness of optimal solution to Lasso
- Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Robust Sparse Analysis Regularization
- Second-order growth, tilt stability, and metric regularity of the subdifferential
- Second-Order Subdifferential Calculus with Applications to Tilt Stability in Optimization
- Sharp, strong and unique minimizers for low complexity robust recovery
- Simple bounds for recovering low-complexity models
- Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained _1 minimization
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT
- The convex geometry of linear inverse problems
- The Lasso problem and uniqueness
- Tilt Stability of a Local Minimum
- Uncertainty principles and ideal atomic decomposition
- Uniqueness in nuclear norm minimization: flatness of the nuclear norm sphere and simultaneous polarization
- Upper-Lipschitz multifunctions and inverse subdifferentials
- Variational Analysis
- Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
Cited in
(3)
This page was built for publication: Solution uniqueness of convex optimization problems via the radial cone
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952253)
