Image de couverture de livre

A quadratically convergent proximal algorithm for nonnegative tensor decomposition

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Vervliet, Nico, Themelis, Andreas, Patrinos, Panagiotis, De Lathauwer, Lieven
Format:	Preprint
Publié:	2020
Sujets:	Optimization and Control 15A69, 49J52, 90C26, 90C53
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
par: Behmandpoor, Pourya, et autres
Publié: (2022)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
par: Ahookhosh, Masoud, et autres
Publié: (2019)

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
par: Latafat, Puya, et autres
Publié: (2019)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
par: Themelis, Andreas, et autres
Publié: (2020)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
par: Bodard, Alexander, et autres
Publié: (2026)

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
par: Latafat, Puya, et autres
Publié: (2021)

QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs
par: Hermans, Ben, et autres
Publié: (2020)

A mirror inertial forward-reflected-backward splitting: Global convergence and linesearch extension beyond convexity and Lipschitz smoothness
par: Wang, Ziyuan, et autres
Publié: (2022)

A new envelope function for nonsmooth DC optimization
par: Themelis, Andreas, et autres
Publié: (2020)

(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
par: Ghaderi, Susan, et autres
Publié: (2025)

Characterizations of the Aubin property of the KKT-mapping in composite optimization by SC derivatives and quadratic bundles
par: Gfrerer, Helmut, et autres
Publié: (2026)

A penalty barrier framework for nonconvex constrained optimization
par: De Marchi, Alberto, et autres
Publié: (2024)

Stationarity in nonsmooth optimization between geometrical motivation and topological relevance
par: Shikhman, Vladimir
Publié: (2024)

Spingarn's Method and Progressive Decoupling Beyond Elicitable Monotonicity
par: Evens, Brecht, et autres
Publié: (2025)

Convergence of the Chambolle-Pock Algorithm in the Absence of Monotonicity
par: Evens, Brecht, et autres
Publié: (2023)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
par: Van Tuyen, Nguyen, et autres
Publié: (2024)

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
par: Rahimi, Morteza, et autres
Publié: (2024)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
par: Kabgani, Alireza, et autres
Publié: (2025)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
par: Latafat, Puya, et autres
Publié: (2023)

Convergence of the Preconditioned Proximal Point Method and Douglas-Rachford Splitting in the Absence of Monotonicity
par: Evens, Brecht, et autres
Publié: (2023)

Convergence Rates for the Alternating Minimization Algorithm in Structured Nonsmooth and Nonconvex Optimization
par: Bento, Glaydston C., et autres
Publié: (2026)

Perturbation analysis of a class of composite optimization problems
par: Tang, Peipei, et autres
Publié: (2024)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
par: Kabgani, Alireza, et autres
Publié: (2024)

Two Typical Implementable Semismooth* Newton Methods for Generalized Equations are G-Semismooth Newton Methods
par: Chen, Liang, et autres
Publié: (2024)

Alternating Iteratively Reweighted $\ell_1$ and Subspace Newton Algorithms for Nonconvex Sparse Optimization
par: Wang, Hao, et autres
Publié: (2024)

A note on the convergence of deterministic gradient sampling in nonsmooth optimization
par: Gebken, Bennet
Publié: (2023)

On the convergence of proximal gradient methods for convex simple bilevel optimization
par: Latafat, Puya, et autres
Publié: (2023)

Nonmonotone subgradient methods based on a local descent lemma
par: Aragón-Artacho, Francisco J., et autres
Publié: (2025)

An interior proximal gradient method for nonconvex optimization
par: De Marchi, Alberto, et autres
Publié: (2022)

Weak sharp minima at infinity and solution stability in mathematical programming via asymptotic analysis
par: Lara, Felipe, et autres
Publié: (2024)

Generalized Metric Subregularity with Applications to High-Order Regularized Newton Methods
par: Li, Guoyin, et autres
Publié: (2024)

Optimization Problems with Difference of Tangentially Convex Functions under Uncertainty
par: Mashkoorzadeh, Feryal, et autres
Publié: (2026)

$\ell_0$-Norm Multiobjective Optimization Models Motivated by Applications to Proton Therapy
par: Cong, Xiaoda, et autres
Publié: (2025)

Finding directional stationary points of DC programs
par: Thi, Hoai An Le, et autres
Publié: (2026)

Moreau envelope and proximal-point methods under the lens of high-order regularization
par: Kabgani, Alireza, et autres
Publié: (2025)

Revisiting the Geometrically Decaying Step Size: Linear Convergence for Smooth or Non-Smooth Functions
par: Kim, Jihun
Publié: (2025)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
par: Latafat, Puya, et autres
Publié: (2023)

Directional Subdifferentials at Infinity and Its Applications
par: Kien, Le Ngoc, et autres
Publié: (2025)

The Least Singular Value Function in Variational Analysis
par: Jelitte, Mario, et autres
Publié: (2025)

Approximate directional stationarity and associated qualification conditions
par: Käming, Isabella, et autres
Publié: (2026)