Imagen de Portada

Fixed-Point Delayed Subgradient Methods for Nonsmooth Convex Optimization Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Pankoon, Ontima, Nimana, Nimit, Cho, Yeol Je
Formato:	Preprint
Publicado:	2026
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Subgradient Splitting Methods for Nonsmooth Fractional Programming with Fixed-Point Constraints
por: Prangprakhon, Mootta, et al.
Publicado: (2025)

Federated Incremental Subgradient Method for Convex Bilevel Optimization Problems
por: Boontawee, Sudkobfa, et al.
Publicado: (2026)

Subgradient Gliding Method for Nonsmooth Convex Optimization
por: Zhu, Zhihan, et al.
Publicado: (2026)

Subgradient Methods for Nonsmooth Convex Functions with Adversarial Errors
por: Gösgens, Martijn, et al.
Publicado: (2025)

Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
por: Ding, Kuangyu, et al.
Publicado: (2024)

A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization
por: Xiao, Nachuan, et al.
Publicado: (2025)

On the Complexity of Finding Small Subgradients in Nonsmooth Optimization
por: Kornowski, Guy, et al.
Publicado: (2022)

Policy Optimization in Robust Control: Weak Convexity and Subgradient Methods
por: Watanabe, Yuto, et al.
Publicado: (2025)

Subgame Perfect Methods in Nonsmooth Convex Optimization
por: Grimmer, Benjamin, et al.
Publicado: (2025)

Stochastic Subgradient Methods with Guaranteed Global Stability in Nonsmooth Nonconvex Optimization
por: Xiao, Nachuan, et al.
Publicado: (2023)

Convergence of Decentralized Stochastic Subgradient-based Methods for Nonsmooth Nonconvex functions
por: Zhang, Siyuan, et al.
Publicado: (2024)

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
por: Li, Hanyang, et al.
Publicado: (2025)

Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization
por: Grimmer, Benjamin, et al.
Publicado: (2023)

A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization
por: Khanh, Pham Duy, et al.
Publicado: (2023)

New Outer Approximation Algorithms for Nonsmooth Convex MINLP Problems
por: Wei, Zhou, et al.
Publicado: (2026)

Stochastic Approximation Proximal Subgradient Method for Stochastic Convex-Concave Minimax Optimization
por: Dai, Yu-Hong, et al.
Publicado: (2024)

An Adaptive Proximal Point Method for Nonsmooth and Nonconvex Optimization on Hadamard Manifolds
por: Amaral, Vitaliano S., et al.
Publicado: (2025)

An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization
por: Jiang, Bo, et al.
Publicado: (2025)

Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization
por: Liu, Zijian, et al.
Publicado: (2025)

Faster Stochastic ADMM for Nonsmooth Composite Convex Optimization in Hilbert Space
por: Deng, Weihua, et al.
Publicado: (2026)

On the Oracle Complexity of a Riemannian Inexact Augmented Lagrangian Method for Riemannian Nonsmooth Composite Problems
por: Xu, Meng, et al.
Publicado: (2024)

First-Order Methods for Nonsmooth Nonconvex Functional Constrained Optimization with or without Slater Points
por: Jia, Zhichao, et al.
Publicado: (2022)

A Nesterov-Accelerated Primal-Dual Splitting Algorithm for Convex Nonsmooth Optimization
por: Condat, Laurent, et al.
Publicado: (2026)

High-Resolution Inertial Dynamics with Time-Rescaled Gradients for Nonsmooth Convex Optimization
por: Le, Manh Hung, et al.
Publicado: (2026)

Locally Linear Convergence for Nonsmooth Convex Optimization via Coupled Smoothing and Momentum
por: Baghbadorani, Reza Rahimi, et al.
Publicado: (2025)

The Stochastic Multi-Proximal Method for Nonsmooth Optimization
por: Condat, Laurent, et al.
Publicado: (2025)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
por: Wang, Alex L.
Publicado: (2025)

Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity
por: Li, Xiao, et al.
Publicado: (2023)

A Method of the Quasidifferential Descent in a Problem of Bringing a Nonsmooth System from One Point to Another
por: Fominyh, Alexander
Publicado: (2022)

AN-SPS: Adaptive Sample Size Nonmonotone Line Search Spectral Projected Subgradient Method for Convex Constrained Optimization Problems
por: Jerinkić, Nataša Krklec, et al.
Publicado: (2022)

An Efficient Stochastic Subgradient Method for the Global Placement Problem in Very Large-Scale Integration Circuits
por: Yue, Yi-Shuang, et al.
Publicado: (2024)

Sum-Rate Maximization via Convex Optimization Using Subgradient Projections Onto Nonlinear Spectral Radius Constraint Sets
por: Kuroda, Hiroki, et al.
Publicado: (2026)

Variational Analysis of a Nonconvex and Nonsmooth Optimization Problem: An Introduction
por: Royset, Johannes O.
Publicado: (2024)

Projected Subgradient Ascent for Convex Maximization
por: Felzenszwalb, Pedro, et al.
Publicado: (2025)

Clipped Gradient Methods for Nonsmooth Convex Optimization under Heavy-Tailed Noise: A Refined Analysis
por: Liu, Zijian
Publicado: (2025)

Low-Rank Extragradient Method for Nonsmooth and Low-Rank Matrix Optimization Problems
por: Garber, Dan, et al.
Publicado: (2022)

New Characterizations of Nonsmooth Convex Functions via Generalized Derivatives
por: Phat, Vo Thanh
Publicado: (2026)

Coderivative-Based Newton Methods with Wolfe Linesearch for Nonsmooth Optimization
por: Chao, Miantao, et al.
Publicado: (2024)

Coderivative-Based Newton Methods in Structured Nonconvex and Nonsmooth Optimization
por: Khanh, Pham Duy, et al.
Publicado: (2024)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
por: Huang, Minhui, et al.
Publicado: (2021)