Copertina

First-order methods on bounded-rank tensors converging to stationary points

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Gao, Bin, Peng, Renfeng, Yuan, Ya-xiang
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control Numerical Analysis Algebraic Geometry 15A69, 40A05, 65K05, 90C30
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Desingularization of bounded-rank tensor sets
di: Gao, Bin, et al.
Pubblicazione: (2024)

Low-rank optimization on Tucker tensor varieties
di: Gao, Bin, et al.
Pubblicazione: (2023)

Quotient geometry of tensor ring decomposition
di: Gao, Bin, et al.
Pubblicazione: (2026)

Optimization on product manifolds under a preconditioned metric
di: Gao, Bin, et al.
Pubblicazione: (2023)

Normalized tensor train decomposition
di: Peng, Renfeng, et al.
Pubblicazione: (2025)

Computing Bouligand stationary points efficiently in low-rank optimization
di: Olikier, Guillaume, et al.
Pubblicazione: (2024)

Low-rank optimization methods based on projected projected-gradient descent that accumulate at Bouligand stationary points
di: Olikier, Guillaume, et al.
Pubblicazione: (2022)

A Variational Characterization and A Line Search Newton-Noda Method for the unifying spectral problem of nonnegative tensors
di: Xu, Jiefeng, et al.
Pubblicazione: (2025)

An NPDo Approach for Tensor Block-Diagonalization
di: Li, Ren-Cang, et al.
Pubblicazione: (2026)

Optimization over the intersection of manifolds
di: Yang, Yan, et al.
Pubblicazione: (2026)

Fast and Accurate CP-HIFI Tensor Decompositions: Exploiting Kronecker Structure
di: Brust, Johannes J., et al.
Pubblicazione: (2026)

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

An apocalypse-free first-order low-rank optimization algorithm with at most one rank reduction attempt per iteration
di: Olikier, Guillaume, et al.
Pubblicazione: (2022)

New gradient methods with 3 dimensional quadratic termination
di: Xie, Yixin, et al.
Pubblicazione: (2026)

Technical results on the convergence of quasi-Newton methods for nonsmooth optimization
di: Gebken, Bennet
Pubblicazione: (2025)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
di: Deng, Kangkang, et al.
Pubblicazione: (2025)

A smoothing proximal gradient algorithm for matrix rank minimization problem
di: Yu, Quan, et al.
Pubblicazione: (2021)

Variance-reduced first-order methods for deterministically constrained stochastic nonconvex optimization with strong convergence guarantees
di: Lu, Zhaosong, et al.
Pubblicazione: (2024)

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

Variational analysis of determinantal varieties
di: Yang, Yan, et al.
Pubblicazione: (2025)

On the asymptotic behavior of a higher-order extrapolation primal-dual interior-point method for nonlinear programming
di: Heeman, Pim, et al.
Pubblicazione: (2025)

ASPEN: An Additional Sampling Penalty Method for Finite-Sum Optimization Problems with Nonlinear Equality Constraints
di: Krejić, Nataša, et al.
Pubblicazione: (2025)

A Jacobi-type Newton method for Nash equilibrium problems with descent guarantees
di: Kolossoski, Oliver, et al.
Pubblicazione: (2022)

Symplectic Extra-gradient Type Method for Solving General Non-monotone Inclusion Problem
di: Yuan, Ya-xiang, et al.
Pubblicazione: (2024)

Shadow splitting methods for nonconvex optimisation: epi-approximation, convergence and saddle point avoidance
di: Atenas, Felipe
Pubblicazione: (2025)

First-order penalty methods for bilevel optimization
di: Lu, Zhaosong, et al.
Pubblicazione: (2023)

A novel numerical method tailored for unconstrained optimization problems
di: Li, Lin, et al.
Pubblicazione: (2025)

Spectral conjugate gradient projection methods for large-scale monotone equations without Lipschitz continuity
di: Hamiss, Kabenge, et al.
Pubblicazione: (2026)

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

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

An interior point method for nonlinear constrained derivative-free optimization
di: Brilli, Andrea, et al.
Pubblicazione: (2021)

Accelerated-gradient-based generalized Levenberg--Marquardt method with oracle complexity bound and local quadratic convergence
di: Marumo, Naoki, et al.
Pubblicazione: (2022)

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

An Additively Preconditioned Trust Region Strategy for Machine Learning
di: Alegría, Samuel Cruz, et al.
Pubblicazione: (2025)

Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth
di: Davis, Damek, et al.
Pubblicazione: (2024)

A descent method for nonsmooth multiobjective optimization problems on Riemannian manifolds
di: Tang, Chunming, et al.
Pubblicazione: (2023)

On the regularization property of Levenberg-Marquardt method with Singular Scaling for nonlinear inverse problems
di: Filippozzi, Rafaela, et al.
Pubblicazione: (2025)

Convergence analysis of the transformed gradient projection algorithms on compact matrix manifolds
di: Ding, Wentao, et al.
Pubblicazione: (2024)

An Optimal Interpolation Set for Model-Based Derivative-Free Optimization Methods
di: Ragonneau, Tom M., et al.
Pubblicazione: (2023)

BUP-TR: Bayesian Underdetermined Projection Trust-Region Methods for Derivative-Free Optimization
di: Hu, Wei, et al.
Pubblicazione: (2026)