Image de couverture de livre

A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhu, Daoli, Zhao, Lei, Zhang, Shuzhong
Format:	Preprint
Publié:	2023
Sujets:	Optimization and Control Machine Learning 90C33, 65K15, 90C46, 49K35, 90C26
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

New Classes of Non-monotone Variational Inequality Problems Solvable via Proximal Gradient on Smooth Gap Functions
par: Zhao, Lei, et autres
Publié: (2025)

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
par: Li, Hanyang, et autres
Publié: (2025)

Nonsmooth convex-concave saddle point problems with cardinality penalties
par: Bian, Wei, et autres
Publié: (2024)

A Single-loop Proximal Subgradient Algorithm for A Class Structured Fractional Programs
par: Han, Deren, et autres
Publié: (2025)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
par: Dahl, Simeon vom, et autres
Publié: (2026)

Optimization Problems with Nearly Convex Objective Functions and Nearly Convex Constraint Sets
par: Thieu, Nguyen Nang, et autres
Publié: (2026)

Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization
par: García-Castaño, Fernando, et autres
Publié: (2024)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
par: Xie, Xiyuan, et autres
Publié: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
par: Zhou, Juan, et autres
Publié: (2024)

An Inexact Proximal Newton Method for Nonconvex Composite Minimization
par: Zhu, Hong
Publié: (2024)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
par: Marumo, Naoki
Publié: (2025)

Binno: A 1st-order method for Bi-level Nonconvex Nonsmooth Optimization for Matrix Factorizations
par: Selicato, Laura, et autres
Publié: (2025)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
par: Turan, Evren M., et autres
Publié: (2023)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
par: Li, Wenjing, et autres
Publié: (2023)

A Stochastic Block-coordinate Proximal Newton Method for Nonconvex Composite Minimization
par: Zhu, Hong, et autres
Publié: (2024)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
par: Kanzow, Christian, et autres
Publié: (2025)

Identification of Active Subfunctions in Finite-Max Minimisation via a Smooth Reformulation
par: Ras, Charl, et autres
Publié: (2024)

Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
par: Saadati, Maryam, et autres
Publié: (2022)

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
par: Xie, Xiyuan, et autres
Publié: (2026)

Riemannian Trust Region Methods for SC$^1$ Minimization
par: Zhang, Chenyu, et autres
Publié: (2023)

One-parameter Filled Function Method for Non-convex Multi-objective Optimization Problems
par: Adhikary, Bikram, et autres
Publié: (2026)

Trust-Region Method for Optimization of Set-Valued Maps Given by Finitely Many Functions
par: Ghosh, Suprova, et autres
Publié: (2025)

Projected gradient descent accumulates at Bouligand stationary points
par: Olikier, Guillaume, et autres
Publié: (2024)

A General Recipe for Parameter-Free Nonconvex Optimization via Higher-Order Regularization
par: Marumo, Naoki, et autres
Publié: (2026)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
par: Jin, Ruinan, et autres
Publié: (2026)

Global Descent Method for Non-convex Multi-objective Optimization Problems
par: Adhikary, Bikram, et autres
Publié: (2025)

Non-Convex Self-Concordant Functions: Practical Algorithms and Complexity Analysis
par: Goldfarb, Donald, et autres
Publié: (2025)

A preconditioned difference of convex functions algorithm with extrapolation and line search
par: Zhang, Ran, et autres
Publié: (2025)

Randomized Submanifold Subgradient Method for Optimization over Stiefel Manifolds
par: Cheung, Andy Yat-Ming, et autres
Publié: (2024)

An Adaptive Order Caputo Fractional Gradient Descent Method for Multi-objective Optimization Problems
par: Shaw, Barsha, et autres
Publié: (2025)

A Globally Convergent Method for Computing B-stationary Points of Mathematical Programs with Equilibrium Constraints
par: Nurkanović, Armin, et autres
Publié: (2025)

An Inexact Regularized Proximal Newton Method without Line Search
par: Dahl, Simeon vom, et autres
Publié: (2024)

An Extended ADMM for 3-Block Nonconvex Nonseparable Problems with Applications
par: Liu, Zekun
Publié: (2024)

Randomized block proximal method with locally Lipschitz continuous gradient
par: Pérez-Aros, Pedro, et autres
Publié: (2025)

Inexact Limited Memory Bundle Method
par: Lampainen, Jenni, et autres
Publié: (2026)

A Cubic Regularization Method for Multiobjective Optimization
par: Gonçalves, Douglas S., et autres
Publié: (2025)

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
par: Kannan, Rohit, et autres
Publié: (2022)

A Tunneling Method for Nonlinear Multi-objective Optimization Problems
par: Adhikary, Bikram, et autres
Publié: (2024)

Mathematical programs with complementarity constraints and application to hyperparameter tuning for nonlinear support vector machines
par: Ward, Samuel, et autres
Publié: (2025)

On circumcentered direct methods for monotone variational inequality problems
par: Behling, Roger, et autres
Publié: (2025)