Cover Image

On the Hardness of the $L_1-L_2$ Regularization Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ouyang, Yuyuan, Yates, Kyle
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 68Q25, 94A12, 90C30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
by: Zhang, Liwei, et al.
Published: (2025)

Beyond Discreteness: Sample Complexity Analysis of Straight-Through Estimator for 1-bit Quantization
by: Jeong, Halyun, et al.
Published: (2025)

Kurdyka-Łojasiewicz exponent via square transformation
by: Ouyang, Wenqing
Published: (2025)

Analysis of Kernel Mirror Prox for Measure Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Noisy phase retrieval from subgaussian measurements
by: Peng, Haiyang, et al.
Published: (2024)

Improved global performance guarantees of second-order methods in convex minimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
by: Ouyang, Wenqing, et al.
Published: (2024)

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

Denoising Hyperbolic-Valued Data by Relaxed Regularizations
by: Beinert, Robert, et al.
Published: (2024)

Denoising Sphere-Valued Data by Relaxed Total Variation Regularization
by: Beinert, Robert, et al.
Published: (2024)

Denoising of Sphere- and SO(3)-Valued Data by Relaxed Tikhonov Regularization
by: Beinert, Robert, et al.
Published: (2023)

Performance Estimation of second-order optimization methods on classes of univariate functions
by: Rubbens, Anne, et al.
Published: (2025)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
by: Nesterov, Yurii
Published: (2025)

Barrier Algorithms for Constrained Non-Convex Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method
by: Wu, Hanju, et al.
Published: (2025)

Topological structure and a polynomial-time solution of linear programming over the real numbers
by: Wei, Jing-Yuan
Published: (2018)

A non-iterative polynomial algorithm for linear programming
by: Jing-Yuan, Wei
Published: (2013)

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)

Birkhoff interpolation models for optimization with some available derivatives
by: Larson, Jeffrey, et al.
Published: (2026)

On the Hardness of Short and Sign-Compatible Circuit Walks
by: Borgwardt, Steffen, et al.
Published: (2024)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
by: Hua, Zheng, et al.
Published: (2021)

A practical randomized trust-region method to escape saddle points in high dimension
by: Dragomir, Radu-Alexandru, et al.
Published: (2026)

A Quantum Computing Approach for the Unit Commitment Problem
by: Halffmann, Pascal, et al.
Published: (2022)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
by: Bousselmi, Nizar, et al.
Published: (2023)

Denoising Multi-Color QR Codes and Stiefel-Valued Data by Relaxed Regularizations
by: Beinert, Robert, et al.
Published: (2025)

The Hard-Constraint PINNs for Interface Optimal Control Problems
by: Lai, Ming-Chih, et al.
Published: (2023)

The Dantzig Selector: Sparse Signals Recovery via l_p-q Minimization
by: Li, Jie, et al.
Published: (2023)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
by: Geremew, W., et al.
Published: (2026)

The Coercive Projection Theorem for Canonical Reciprocal Costs
by: Washburn, Jonathan, et al.
Published: (2026)

Gromov-Wasserstein Barycenters: The Analysis Problem
by: Martín, Rocío Díaz, et al.
Published: (2025)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
by: Mohammadisiahroudi, Mohammadhossein, et al.
Published: (2023)

The Güler-type acceleration for proximal gradient, linearized augmented Lagrangian and linearized alternating direction method of multipliers
by: Zhou, Bin, et al.
Published: (2025)

A New Spectral Conjugate Subgradient Method with Application in Computed Tomography Image Reconstruction
by: Loreto, Milagros, et al.
Published: (2023)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
by: Goerigk, Marc, et al.
Published: (2026)

Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
by: Vodeb, Jaka, et al.
Published: (2024)

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

PurSAMERE: Reliable Adversarial Purification via Sharpness-Aware Minimization of Expected Reconstruction Error
by: Hoang, Vinh, et al.
Published: (2026)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
by: Curtis, Frank E., et al.
Published: (2025)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
by: Rubbens, Anne, et al.
Published: (2024)

Wall-Clock Complexity for Zeroth-Order Optimization with Tunable Oracle Fidelity
by: Suvorikova, Alexandra, et al.
Published: (2026)