Tractable downfall of basis pursuit in structured sparse optimization
Fuente:
arXiv
Saved in:
| Main Authors: | Marmary, Maya V., Grussler, Christian |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Alternating minimization for square root principal component pursuit
by: Deng, Shengxiang, et al.
Published: (2024)
by: Deng, Shengxiang, et al.
Published: (2024)
Convergence analysis of a primal-dual optimization-by-continuation algorithm
by: Loris, Ignace, et al.
Published: (2023)
by: Loris, Ignace, et al.
Published: (2023)
Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
by: Themelis, Andreas, et al.
Published: (2020)
by: Themelis, Andreas, et al.
Published: (2020)
Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
by: Rahimi, Morteza, et al.
Published: (2024)
by: Rahimi, Morteza, et al.
Published: (2024)
A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
by: Ahookhosh, Masoud, et al.
Published: (2019)
by: Ahookhosh, Masoud, et al.
Published: (2019)
SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
by: Behmandpoor, Pourya, et al.
Published: (2022)
by: Behmandpoor, Pourya, et al.
Published: (2022)
(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
by: Ghaderi, Susan, et al.
Published: (2025)
by: Ghaderi, Susan, et al.
Published: (2025)
Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
by: Latafat, Puya, et al.
Published: (2021)
by: Latafat, Puya, et al.
Published: (2021)
Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
by: Latafat, Puya, et al.
Published: (2019)
by: Latafat, Puya, et al.
Published: (2019)
On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method
by: Wu, Hanju, et al.
Published: (2025)
by: Wu, Hanju, et al.
Published: (2025)
Pareto-optimal Trade-offs Between Communication and Computation with Flexible Gradient Tracking
by: Huang, Yan, et al.
Published: (2025)
by: Huang, Yan, et al.
Published: (2025)
ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)
by: Kabgani, Alireza, et al.
Published: (2025)
ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
by: Kabgani, Alireza, et al.
Published: (2024)
by: Kabgani, Alireza, et al.
Published: (2024)
Approximate optimality conditions and sensitivity analysis in nearly convex optimization
by: Van Tuyen, Nguyen, et al.
Published: (2024)
by: Van Tuyen, Nguyen, et al.
Published: (2024)
A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
by: Dörfler, Daniel, et al.
Published: (2020)
by: Dörfler, Daniel, et al.
Published: (2020)
Projection, Degeneracy, and Singularity Degree for Spectrahedra
by: Im, Haesol, et al.
Published: (2024)
by: Im, Haesol, et al.
Published: (2024)
T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
by: Marumo, Hiroki, et al.
Published: (2024)
by: Marumo, Hiroki, et al.
Published: (2024)
NewVEM: A Newton Vertex Exchange Method for a Class of Constrained Self-Concordant Minimization Problems
by: Liang, Ling, et al.
Published: (2024)
by: Liang, Ling, et al.
Published: (2024)
Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
by: Lin, Zhenwei, et al.
Published: (2022)
by: Lin, Zhenwei, et al.
Published: (2022)
Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
by: Prakhya, Karthik, et al.
Published: (2026)
by: Prakhya, Karthik, et al.
Published: (2026)
A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
by: Namchaisiri, Charles, et al.
Published: (2024)
by: Namchaisiri, Charles, et al.
Published: (2024)
Variance-Reduced Fast Operator Splitting Methods for Generalized Equations
by: Tran-Dinh, Quoc
Published: (2025)
by: Tran-Dinh, Quoc
Published: (2025)
Accelerated Extragradient-Type Methods -- Part 2: Generalization and Sublinear Convergence Rates under Co-Hypomonotonicity
by: Tran-Dinh, Quoc, et al.
Published: (2025)
by: Tran-Dinh, Quoc, et al.
Published: (2025)
Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems
by: Tran-Dinh, Quoc
Published: (2024)
by: Tran-Dinh, Quoc
Published: (2024)
Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Rates
by: Tran-Dinh, Quoc, et al.
Published: (2024)
by: Tran-Dinh, Quoc, et al.
Published: (2024)
Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints
by: Berahas, Albert S., et al.
Published: (2025)
by: Berahas, Albert S., et al.
Published: (2025)
On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
by: Bollapragada, Raghu, et al.
Published: (2025)
by: Bollapragada, Raghu, et al.
Published: (2025)
Level Constrained First Order Methods for Function Constrained Optimization
by: Boob, Digvijay, et al.
Published: (2022)
by: Boob, Digvijay, et al.
Published: (2022)
Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
by: Takahashi, Shota, et al.
Published: (2025)
by: Takahashi, Shota, et al.
Published: (2025)
First and Second Order Necessary and Sufficient Optimality Conditions of Fritz John Type for Vector Problems over Cones
by: Ivanov, Vsevolod I.
Published: (2024)
by: Ivanov, Vsevolod I.
Published: (2024)
Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
by: Ou, Hongjia, et al.
Published: (2025)
by: Ou, Hongjia, et al.
Published: (2025)
A Solution Concept for Convex Vector Optimization Problems based on a User-defined Region of Interest
by: Dörfler, Daniel, et al.
Published: (2026)
by: Dörfler, Daniel, et al.
Published: (2026)
Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
by: Geremew, W., et al.
Published: (2026)
by: Geremew, W., et al.
Published: (2026)
A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
by: He, Chuan, et al.
Published: (2023)
by: He, Chuan, et al.
Published: (2023)
Fast Computation of Superquantile-Constrained Optimization Through Implicit Scenario Reduction
by: Roth, Jake, et al.
Published: (2024)
by: Roth, Jake, et al.
Published: (2024)
Performance Estimation of second-order optimization methods on classes of univariate functions
by: Rubbens, Anne, et al.
Published: (2025)
by: Rubbens, Anne, et al.
Published: (2025)
Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
by: Chen, Kaihuang, et al.
Published: (2025)
by: Chen, Kaihuang, et al.
Published: (2025)
A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
by: Hou, Di, et al.
Published: (2023)
by: Hou, Di, et al.
Published: (2023)
A squared smoothing Newton method for semidefinite programming
by: Liang, Ling, et al.
Published: (2023)
by: Liang, Ling, et al.
Published: (2023)
A Projection-Free Method for Solving Convex Bilevel Optimization Problems
by: Giang-Tran, Khanh-Hung, et al.
Published: (2023)
by: Giang-Tran, Khanh-Hung, et al.
Published: (2023)
Similar Items
-
Alternating minimization for square root principal component pursuit
by: Deng, Shengxiang, et al.
Published: (2024) -
Convergence analysis of a primal-dual optimization-by-continuation algorithm
by: Loris, Ignace, et al.
Published: (2023) -
Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
by: Themelis, Andreas, et al.
Published: (2020) -
Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
by: Rahimi, Morteza, et al.
Published: (2024) -
A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
by: Ahookhosh, Masoud, et al.
Published: (2019)