Cover Image

Trust Region Methods For Nonconvex Stochastic Optimization Beyond Lipschitz Smoothness

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Xie, Chenghan, Li, Chenxi, Zhang, Chuwen, Deng, Qi, Ge, Dongdong, Ye, Yinyu
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Beyond Nonconvexity: A Universal Trust-Region Method with New Analyses
by: Jiang, Yuntian, et al.
Published: (2023)

A Homogeneous Second-Order Descent Method for Nonconvex Optimization
by: Zhang, Chuwen, et al.
Published: (2022)

A Homogenization Approach for Gradient-Dominated Stochastic Optimization
by: Tan, Jiyuan, et al.
Published: (2023)

Accelerating Trust-Region Methods: An Attempt to Balance Global and Local Efficiency
by: Jiang, Yuntian, et al.
Published: (2025)

Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity
by: Xia, Jingfan, et al.
Published: (2025)

Homogeneous Second-Order Descent Framework: A Fast Alternative to Newton-Type Methods
by: He, Chang, et al.
Published: (2023)

An Enhanced ADMM-based Interior Point Method for Linear and Conic Optimization
by: Deng, Qi, et al.
Published: (2022)

Adaptive Regularization within Trust Region Methods for Stochastic Nonconvex Optimization
by: Ha, Yunsoo, et al.
Published: (2026)

Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity
by: Gao, Wenzhi, et al.
Published: (2024)

A Low-Rank ADMM Splitting Approach for Semidefinite Programming
by: Han, Qiushi, et al.
Published: (2024)

cuPDLP-C: A Strengthened Implementation of cuPDLP for Linear Programming by C language
by: Lu, Haihao, et al.
Published: (2023)

PDHCG: A Scalable First-Order Method for Large-Scale Competitive Market Equilibrium Computation
by: Liu, Huikang, et al.
Published: (2025)

Cardinal Optimizer (COPT) User Guide
by: Ge, Dongdong, et al.
Published: (2022)

The Second-Order Tâtonnement: Decentralized Interior-Point Methods for Market Equilibrium
by: Zhang, Chuwen, et al.
Published: (2025)

Dual Averaging Converges for Nonconvex Smooth Stochastic Optimization
by: Liu, Tuo, et al.
Published: (2025)

Restarted Primal-Dual Hybrid Conjugate Gradient Method for Large-Scale Quadratic Programming
by: Huang, Yicheng, et al.
Published: (2024)

A Practical GPU-Enhanced Matrix-Free Primal-Dual Method for Large-Scale Conic Programs
by: Lin, Zhenwei, et al.
Published: (2025)

Learning to Pivot as a Smart Expert
by: Liu, Tianhao, et al.
Published: (2023)

A Technical Note on the Implementation and Use of PDCS
by: Lin, Zhenwei, et al.
Published: (2026)

Beyond $\mathcal{O}(\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming
by: Gao, Wenzhi, et al.
Published: (2025)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
by: Su, Yuexin, et al.
Published: (2026)

Decentralized Stochastic Nonconvex Optimization under the Relaxed Smoothness
by: Luo, Luo, et al.
Published: (2025)

Adaptive Lipschitz-Free Conditional Gradient Methods for Stochastic Composite Nonconvex Optimization
by: Yuan, Ganzhao
Published: (2026)

Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU
by: Han, Qiushi, et al.
Published: (2024)

PDHCG-II: An Enhanced Version of PDHCG for Large-Scale Convex QP
by: Li, Hongpei, et al.
Published: (2026)

A Single-Loop Robust Policy Gradient Method for Robust Markov Decision Processes
by: Lin, Zhenwei, et al.
Published: (2024)

Decoupling Learning and Decision-Making: Breaking the $\mathcal{O}(\sqrt{T})$ Barrier in Online Resource Allocation with First-Order Methods
by: Gao, Wenzhi, et al.
Published: (2024)

A Finite-Difference Trust-Region Method for Convexly Constrained Smooth Optimization
by: Davar, Dânâ, et al.
Published: (2025)

Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints
by: Huang, Ruichuan, et al.
Published: (2025)

Data-driven Mixed Integer Optimization through Probabilistic Multi-variable Branching
by: Chen, Yanguang, et al.
Published: (2023)

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

OptPipe: Memory- and Scheduling-Optimized Pipeline Parallelism for LLM Training
by: Li, Hongpei, et al.
Published: (2025)

Compressed Distributed Stochastic Nonconvex Optimization with Differential Privacy
by: Xie, Antai, et al.
Published: (2026)

Solving Linear Programs with Fast Online Learning Algorithms
by: Gao, Wenzhi, et al.
Published: (2021)

From an Interior Point to a Corner Point: Smart Crossover
by: Ge, Dongdong, et al.
Published: (2021)

Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness
by: He, Qi, et al.
Published: (2025)

Orientation Determination of Cryo-EM Images Using Block Stochastic Riemannian Subgradient Methods
by: Zhang, Wanyu, et al.
Published: (2024)

On the Complexity of Decentralized Smooth Nonconvex Finite-Sum Optimization
by: Luo, Luo, et al.
Published: (2022)

Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems
by: Yuan, Bowen, et al.
Published: (2025)

Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization
by: Bakkali, Taha El, et al.
Published: (2026)