Cover Image

Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cai, HanQin, Huang, Longxiu, Lu, Xiliang, You, Juntao
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Information Theory Signal Processing Optimization and Control 15A29, 15A83, 47B35, 90C17, 90C26, 90C53
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Quotient Manifold Optimization for Spectral Compressed Sensing
by: Wang, Wenlong, et al.
Published: (2025)

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
by: Menickelly, Matt, et al.
Published: (2023)

Copositivity criteria of a class of fourth order 3-dimensional symmetric tensors
by: Song, Yisheng, et al.
Published: (2023)

Application and issues in abstract convexity
by: Millán, Reinier Díaz, et al.
Published: (2022)

Multivariate approximation by polynomial and generalised rational functions
by: Millán, R. Díaz, et al.
Published: (2021)

Bivariate rational approximations of the general temperature integral
by: Aghili, Alireza, et al.
Published: (2024)

A Note on Piecewise Affine Decision Rules for Robust, Stochastic, and Data-Driven Optimization
by: Thomä, Simon, et al.
Published: (2024)

A quadratically convergent proximal algorithm for nonnegative tensor decomposition
by: Vervliet, Nico, et al.
Published: (2020)

Quasi-Newton Method for Set Optimization Problems with Set-Valued Mapping Given by Finitely Many Vector-Valued Functions
by: Ghosh, Debdas, et al.
Published: (2024)

Quasi-Newton methods for minimizing a quadratic function subject to uncertainty
by: Peng, Shen, et al.
Published: (2021)

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
by: Fest, Jean-Baptiste, et al.
Published: (2023)

On the analysis of optimization with fixed-rank matrices: a quotient geometric view
by: Dong, Shuyu, et al.
Published: (2022)

Alternating Iteratively Reweighted $\ell_1$ and Subspace Newton Algorithms for Nonconvex Sparse Optimization
by: Wang, Hao, et al.
Published: (2024)

Escaping Local Minima Provably in Non-convex Matrix Sensing: A Deterministic Framework via Simulated Lifting
by: Shen, Tianqi, et al.
Published: (2026)

Cubic Regularization Technique of the Newton Method for Vector Optimization
by: Ghosh, Debdas
Published: (2025)

A Complete Loss Landscape Analysis of Regularized Deep Matrix Factorization
by: Chen, Po, et al.
Published: (2025)

Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence
by: Fatkhullin, Ilyas, et al.
Published: (2024)

Nonlinear Conjugate Gradient Methods for Optimization of Set-Valued Mappings of Finite Cardinality
by: Ghosh, Debdas, et al.
Published: (2024)

Effective Front-Descent Algorithms with Convergence Guarantees
by: Lapucci, Matteo, et al.
Published: (2024)

Shuffling the Stochastic Mirror Descent via Dual Lipschitz Continuity and Kernel Conditioning
by: Qiu, Junwen, et al.
Published: (2026)

Stochastic block coordinate and function alternation for multi-objective optimization and learning
by: Tran, Trang H., et al.
Published: (2026)

Stochastic Gradient Descent Revisited
by: Louzi, Azar
Published: (2024)

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

Optimization landscape of $\ell_0$-Bregman relaxations
by: Chirinos-Rodríguez, Jonathan, et al.
Published: (2025)

QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs
by: Hermans, Ben, et al.
Published: (2020)

Difference of Convex (DC) approach for neural network approximation with uniform loss function
by: Peiris, Vinesha, et al.
Published: (2026)

SUDA-Muon: Structural Design Principles and Boundaries for Fully Decentralized Muon
by: Zhang, Hengrui, et al.
Published: (2026)

A Unifying Convexification Framework for Chance-Constrained Programs via Bilinear Extended Formulations over a Simplex
by: Davarnia, Danial, et al.
Published: (2025)

Extended Triangle Inequalities for Nonconvex Box-Constrained Quadratic Programming
by: Anstreicher, Kurt M., et al.
Published: (2025)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
by: Xie, Yue, et al.
Published: (2025)

Reinforcement-learning-based Algorithms for Optimization Problems and Applications to Inverse Problems
by: Xu, Chen, et al.
Published: (2023)

Fast and Provable Nonconvex Robust Matrix Completion
by: Fu, Yichen, et al.
Published: (2026)

Some optimality conditions of set-valued optimization problems in locally convex topological vector spaces
by: Zeng, Renying
Published: (2024)

Random Reshuffling with Momentum for Nonconvex Problems: Iteration Complexity and Last Iterate Convergence
by: Qiu, Junwen, et al.
Published: (2024)

Single Element Error Correction/ in a Euclidean Distance Matrix
by: Alfakih, Abdo, et al.
Published: (2024)

New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
by: Wang, Xuejie, et al.
Published: (2023)

Transformed $\ell_p$ Minimization Model and Sparse Signal Recovery
by: Li, Ziwei, et al.
Published: (2026)

Fully First-Order Methods for Decentralized Bilevel Optimization
by: Wang, Xiaoyu, et al.
Published: (2024)

The vector linear program solver Bensolve -- notes on theoretical background
by: Löhne, Andreas, et al.
Published: (2015)

Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
by: Löhne, Andreas, et al.
Published: (2015)