Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
Fuente:
arXiv
Saved in:
| Main Authors: | Latafat, Puya, Themelis, Andreas, Ahookhosh, Masoud, Patrinos, Panagiotis |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
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)
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)
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)
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)
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)
(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)
PANOC-lite: A simpler and more efficient algorithm for composite minimization
by: Bodard, Alexander, et al.
Published: (2026)
by: Bodard, Alexander, et al.
Published: (2026)
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)
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)
A penalty barrier framework for nonconvex constrained optimization
by: De Marchi, Alberto, et al.
Published: (2024)
by: De Marchi, Alberto, et al.
Published: (2024)
QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs
by: Hermans, Ben, et al.
Published: (2020)
by: Hermans, Ben, et al.
Published: (2020)
Spingarn's Method and Progressive Decoupling Beyond Elicitable Monotonicity
by: Evens, Brecht, et al.
Published: (2025)
by: Evens, Brecht, et al.
Published: (2025)
Convergence of the Chambolle-Pock Algorithm in the Absence of Monotonicity
by: Evens, Brecht, et al.
Published: (2023)
by: Evens, Brecht, et al.
Published: (2023)
A quadratically convergent proximal algorithm for nonnegative tensor decomposition
by: Vervliet, Nico, et al.
Published: (2020)
by: Vervliet, Nico, et al.
Published: (2020)
A mirror inertial forward-reflected-backward splitting: Global convergence and linesearch extension beyond convexity and Lipschitz smoothness
by: Wang, Ziyuan, et al.
Published: (2022)
by: Wang, Ziyuan, et al.
Published: (2022)
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)
Lipschitz stability of least-squares problems regularized by functions with $\mathcal{C}^2$-cone reducible conjugates
by: Cui, Ying, et al.
Published: (2024)
by: Cui, Ying, et al.
Published: (2024)
Geometric characterizations of Lipschitz stability for convex optimization problems
by: Nghia, Tran T. A.
Published: (2024)
by: Nghia, Tran T. A.
Published: (2024)
An augmented Lagrangian method for strongly regular minimizers in a class of convex composite optimization problems
by: Wang, Chengjing, et al.
Published: (2025)
by: Wang, Chengjing, et al.
Published: (2025)
Convergence of the Preconditioned Proximal Point Method and Douglas-Rachford Splitting in the Absence of Monotonicity
by: Evens, Brecht, et al.
Published: (2023)
by: Evens, Brecht, et al.
Published: (2023)
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)
Local properties and augmented Lagrangians in fully nonconvex composite optimization
by: De Marchi, Alberto, et al.
Published: (2023)
by: De Marchi, Alberto, et al.
Published: (2023)
On the existence and the stability of solutions in nonconvex vector optimization
by: Van Nghi, Tran, et al.
Published: (2025)
by: Van Nghi, Tran, et al.
Published: (2025)
Directional Subdifferentials at Infinity and Its Applications
by: Kien, Le Ngoc, et al.
Published: (2025)
by: Kien, Le Ngoc, et al.
Published: (2025)
Stationarity in nonsmooth optimization between geometrical motivation and topological relevance
by: Shikhman, Vladimir
Published: (2024)
by: Shikhman, Vladimir
Published: (2024)
The Least Singular Value Function in Variational Analysis
by: Jelitte, Mario, et al.
Published: (2025)
by: Jelitte, Mario, et al.
Published: (2025)
Approximate directional stationarity and associated qualification conditions
by: Käming, Isabella, et al.
Published: (2026)
by: Käming, Isabella, et al.
Published: (2026)
First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
by: Kabgani, Alireza, et al.
Published: (2025)
by: Kabgani, Alireza, et al.
Published: (2025)
Second-Order Optimality Conditions for Sparse Differentiable Optimization Problems via Limiting Second-Order Subdifferentials
by: Huyen, Luu Thi Thu, et al.
Published: (2026)
by: Huyen, Luu Thi Thu, et al.
Published: (2026)
On the directional asymptotic approach in optimization theory
by: Benko, Matúš, et al.
Published: (2024)
by: Benko, Matúš, et al.
Published: (2024)
Moreau envelope and proximal-point methods under the lens of high-order regularization
by: Kabgani, Alireza, et al.
Published: (2025)
by: Kabgani, Alireza, et al.
Published: (2025)
Clarke's tangent cones, subgradients, optimality conditions and the Lipschitzness at infinity
by: Nguyen, Minh Tung, et al.
Published: (2022)
by: Nguyen, Minh Tung, et al.
Published: (2022)
On the growth of nonconvex functionals at strict local minimizers
by: Corella, Alberto Domínguez, et al.
Published: (2024)
by: Corella, Alberto Domínguez, et al.
Published: (2024)
Isolated Calmness in Regularized Convex Optimization
by: Nghia, Tran T. A., et al.
Published: (2026)
by: Nghia, Tran T. A., et al.
Published: (2026)
On second-order optimality conditions for $C^{1,1}$ optimization problems via Lagrangian functions
by: An, Duong Thi Viet, et al.
Published: (2024)
by: An, Duong Thi Viet, et al.
Published: (2024)
Two Typical Implementable Semismooth* Newton Methods for Generalized Equations are G-Semismooth Newton Methods
by: Chen, Liang, et al.
Published: (2024)
by: Chen, Liang, et al.
Published: (2024)
Tilt stability of Ky-Fan $κ$-norm composite optimization
by: Liu, Yulan, et al.
Published: (2024)
by: Liu, Yulan, et al.
Published: (2024)
Primal and dual characterizations of sign-symmetric norms
by: Cuong, Nguyen Duy
Published: (2025)
by: Cuong, Nguyen Duy
Published: (2025)
On second-order Karush--Kuhn--Tucker optimality conditions for $C^{1,1}$ vector optimization problems
by: Van Tuyen, Nguyen
Published: (2025)
by: Van Tuyen, Nguyen
Published: (2025)
On second-order variational analysis of variational convexity of prox-regular functions
by: Gfrerer, Helmut
Published: (2024)
by: Gfrerer, Helmut
Published: (2024)
Similar Items
-
Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
by: Latafat, Puya, et al.
Published: (2019) -
SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
by: Behmandpoor, Pourya, et al.
Published: (2022) -
A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
by: Ahookhosh, Masoud, et al.
Published: (2019) -
Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
by: Themelis, Andreas, et al.
Published: (2020) -
ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
by: Kabgani, Alireza, et al.
Published: (2024)