Imagen de Portada

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	He, Jiahuan, Kan, Chao, Song, Wen
Formato:	Preprint
Publicado:	2023
Materias:	Optimization and Control 90C25, 90C46, 90C05, 65K05
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
por: Traoré, Cheik, et al.
Publicado: (2025)

Augmented Lagrangian methods for fully convex composite optimization
por: De Marchi, Alberto, et al.
Publicado: (2025)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
por: Li, Wenjing, et al.
Publicado: (2023)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
por: Zhou, Yingxin, et al.
Publicado: (2025)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
por: Kanzow, Christian, et al.
Publicado: (2025)

Splitting Algorithms for Distributionally Robust Optimization
por: Briceño-Arias, Luis, et al.
Publicado: (2024)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
por: Song, Yongcun, et al.
Publicado: (2024)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
por: Chen, Jian, et al.
Publicado: (2026)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
por: Meng, Kaiwen, et al.
Publicado: (2024)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
por: Wang, Haoning, et al.
Publicado: (2025)

Performance Estimation for Smooth and Strongly Convex Sets
por: Luner, Alan, et al.
Publicado: (2024)

A Regression-Based Prediction-Correction Method for Stochastic Time-Varying Optimization Problems
por: Kamijima, Tomoya, et al.
Publicado: (2025)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
por: Zhang, Lu, et al.
Publicado: (2026)

On Averaging and Extrapolation for Gradient Descent
por: Luner, Alan, et al.
Publicado: (2024)

Extragradient method with feasible inexact projection to variational inequality problem
por: Millán, R. Díaz, et al.
Publicado: (2023)

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
por: Gu, Ran, et al.
Publicado: (2021)

On the convergence of proximal gradient methods for convex simple bilevel optimization
por: Latafat, Puya, et al.
Publicado: (2023)

Semi-Monotone Goldstein Line Search Strategy with Application in Sparse Recovery
por: Shabani, Shima, et al.
Publicado: (2025)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
por: Niu, Yi-Shuai, et al.
Publicado: (2018)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
por: Takahashi, Shota, et al.
Publicado: (2025)

Monomial barrier functions for the box-constrained convex optimization problems
por: Fayed, Hatem
Publicado: (2024)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
por: Nguyen, Vinh
Publicado: (2025)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
por: Bao, Chenglong, et al.
Publicado: (2024)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
por: Bao, Chenglong, et al.
Publicado: (2023)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
por: Zhang, Chenyu, et al.
Publicado: (2023)

Nonsmooth convex-concave saddle point problems with cardinality penalties
por: Bian, Wei, et al.
Publicado: (2024)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
por: Brosch, Daniel, et al.
Publicado: (2025)

Nonsmooth Projection-Free Optimization with Functional Constraints
por: Asgari, Kamiar, et al.
Publicado: (2023)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
por: Zhou, Juan, et al.
Publicado: (2024)

On the Convergence Rates of Iterative Regularization Algorithms for Composite Bi-Level Optimization
por: Shtern, Shimrit, et al.
Publicado: (2025)

Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
por: Nandhan, Navil, et al.
Publicado: (2026)

Trust-Region Method for Optimization of Set-Valued Maps Given by Finitely Many Functions
por: Ghosh, Suprova, et al.
Publicado: (2025)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
por: Hu, Wei, et al.
Publicado: (2026)

Bregman proximal gradient method for linear optimization under entropic constraints
por: Briceño-Arias, Luis M., et al.
Publicado: (2025)

Dynamic FISTA for Convex Composite Bi-Level Optimization
por: Merchav, Roey, et al.
Publicado: (2024)

General Optimal Step-size for ADMM-type Algorithms: Domain Parametrization and Optimal Rates
por: Ran, Yifan
Publicado: (2023)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
por: Millán, R. Díaz, et al.
Publicado: (2026)

A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
por: Xie, Pengcheng, et al.
Publicado: (2023)

A Massively Parallel Interior-Point Method for Arrowhead Linear Programs with Local Linking Structure
por: Kempke, Nils-Christian, et al.
Publicado: (2024)

A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
por: Lin, Yizun, et al.
Publicado: (2024)