Copertina

Fast and Provable Nonconvex Robust Matrix Completion

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Fu, Yichen, Wang, Tianming, Wei, Ke
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Information Theory 15A83, 49N30, 68Q25, 90C26
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
di: He, Chuan, et al.
Pubblicazione: (2023)

An Efficient Stochastic First-Order Algorithm for Nonconvex-Strongly Concave Minimax Optimization beyond Lipschitz Smoothness
di: Gao, Yan, et al.
Pubblicazione: (2026)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
di: Yang, Xiangyu, et al.
Pubblicazione: (2021)

The Optimality of a Nested Generalized Pairwise Group Testing Procedure
di: Malinovsky, Yaakov, et al.
Pubblicazione: (2025)

A search-free $O(1/k^{3/2})$ homotopy inexact proximal-Newton extragradient algorithm for monotone variational inequalities
di: Alves, M. Marques, et al.
Pubblicazione: (2023)

Lagrange duality on DC evenly convex optimization problems via a generalized conjugation scheme
di: Fajardo, M. D., et al.
Pubblicazione: (2024)

A new insight into Lagrange duality on DC optimization
di: Fajardo, M. D., et al.
Pubblicazione: (2025)

On Subdifferentials Via a Generalized Conjugation Scheme: An Application to DC Problems and Optimality Conditions
di: Fajardo, M. D., et al.
Pubblicazione: (2025)

On Fenchel c-conjugate dual problems for DC optimization: characterizing weak, strong and stable strong duality
di: Fajardo, M. D., et al.
Pubblicazione: (2025)

Incremental Certificate Learning for Hybrid Neural Network Verification . A Solver Architecture for Piecewise-Linear Safety Queries
di: Gokavarapu, Chandrasekhar
Pubblicazione: (2025)

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

Data-Driven Priors in the Maximum Entropy on the Mean Method for Linear Inverse Problems
di: King-Roskamp, Matthew, et al.
Pubblicazione: (2024)

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

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

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
di: Yuan, Ya-xiang, et al.
Pubblicazione: (2024)

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

Kurdyka-Łojasiewicz exponent via square transformation
di: Ouyang, Wenqing
Pubblicazione: (2025)

Dimension-free estimators of gradients of functions with(out) non-independent variables
di: Lamboni, Matieyendou
Pubblicazione: (2025)

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

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

Chordal-NMF with Riemannian Multiplicative Update
di: Esposito, Flavia, et al.
Pubblicazione: (2024)

Optimization on the Oblique Manifold for Sparse Simplex Constraints via Multiplicative Updates
di: Esposito, Flavia, et al.
Pubblicazione: (2025)

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

A semidefinite programming characterization of the Crawford number
di: Friedland, Shmuel, et al.
Pubblicazione: (2024)

Benign landscapes for synchronization on spheres via normalized Laplacian matrices
di: McRae, Andrew D.
Pubblicazione: (2025)

Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent
di: Cai, HanQin, et al.
Pubblicazione: (2024)

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

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

A General Recipe for Parameter-Free Nonconvex Optimization via Higher-Order Regularization
di: Marumo, Naoki, et al.
Pubblicazione: (2026)

Policy Optimization over General State and Action Spaces
di: Ju, Caleb, et al.
Pubblicazione: (2022)

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

On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
di: Friedland, Shmuel
Pubblicazione: (2023)

Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization
di: García-Castaño, Fernando, et al.
Pubblicazione: (2024)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
di: Gratton, Serge, et al.
Pubblicazione: (2024)

Complexity and performance for two classes of noise-tolerant first-order algorithms
di: Gratton, S., et al.
Pubblicazione: (2022)

On the equivalence of $c$-potentiability and $c$-path boundedness in the sense of Artstein-Avidan, Sadovsky, and Wyczesany
di: Bartz, Sedi, et al.
Pubblicazione: (2025)

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

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

An inertial iteratively regularized extragradient method for bilevel variational inequality problems
di: Alves, M. Marques, et al.
Pubblicazione: (2025)