Solution Uniqueness of Convex Piecewise Affine Functions Based Optimization with Applications to Constrained $\ell_1$ Minimization

Type: Preprint

Publication Date: 2017-01-01

Citations: 14

DOI: https://doi.org/10.48550/arxiv.1711.05882

Locations

  • arXiv (Cornell University) - View - PDF
  • DataCite API - View

Similar Works

Action Title Year Authors
+ PDF Chat Necessary and Sufficient Conditions of Solution Uniqueness in 1-Norm Minimization 2014 Hui Zhang
Wotao Yin
Lizhi Cheng
+ PDF Chat Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$ 2018 Jinglai Shen
Seyedahmad Mousavi
+ Least Sparsity of $p$-norm based Optimization Problems with $p > 1$ 2017 Jinglai Shen
Seyedahmad Mousavi
+ Tractable ADMM Schemes for Computing KKT Points and Local Minimizers for $\ell_0$-Minimization Problems 2017 Yue Xie
Uday V. Shanbhag
+ A Primal Dual Active Set Algorithm for a Class of Nonconvex Sparsity Optimization 2013 Yuling Jiao
Bangti Jin
Xiliang Lu
Weina Ren
+ Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications 2020 Qing Qu
Zhihui Zhu
Xiao Li
Manolis C. Tsakiris
John Wright
René Vidal
+ A Unified Primal Dual Active Set Algorithm for Nonconvex Sparse Recovery 2013 Jian Huang
Yuling Jiao
Bangti Jin
Jin Liu
Xiliang Lu
Can Yang
+ PDF Chat Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization 2010 Xiaojun Chen
Fengmin Xu
Yinyu Ye
+ Bilevel Imaging Learning Problems as Mathematical Programs with Complementarity Constraints: Reformulation and Theory 2023 Juan Carlos De los Reyes
+ PDF Chat A Unified Primal Dual Active Set Algorithm for Nonconvex Sparse Recovery 2021 Jian Huang
Yuling Jiao
Bangti Jin
Jin Liu
Xiliang Lu
Can Yang
+ Bilevel Imaging Learning Problems as Mathematical Programs with Complementarity Constraints: Reformulation and Theory 2021 Juan Carlos De los Reyes
David Villacís
+ Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations 2021 Chungen Shen
Liu Xiao
+ A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations 2017 Hoang Tran
Clayton Webster
+ A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations 2017 Hoang Tran
Clayton Webster
+ PDF Chat Estimating Sparse Signals with Smooth Support via Convex Programming and Block Sparsity 2016 Sohil Shah
Tom Goldstein
Christoph Studer
+ PDF Chat Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets 2016 Yun-Bin Zhao
Zhi-Quan Luo
+ A full splitting algorithm for fractional programs with structured numerators and denominators 2023 Radu Ioan Boţ
Guoyin Li
Min Tao
+ Optimal First Order Methods for a Class of Non-Smooth Convex Optimization with Applications to Image Analysis 2013 Yuyuan Ouyang
+ A General System for Heuristic Solution of Convex Problems over Nonconvex Sets 2016 Steven Diamond
Reza Takapoui
Stephen Boyd
+ PDF Chat Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing 2019 Alessandro Lanza
Serena Morigi
Ivan Selesnick
Fiorella Sgallari