Cover Image

Efficient First Order Method for Saddle Point Problems with Higher Order Smoothness

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Nuozhou, Zhang, Junyu, Zhang, Shuzhong
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

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization
by: Wang, Nuozhou, et al.
Published: (2025)

An Accelerated Variance Reduced Extra-Point Approach to Finite-Sum VI and Optimization
by: Huang, Kevin, et al.
Published: (2022)

Direct Spectral Acceleration of First-Order Methods for Saddle Point Problems with Bilinear Coupling
by: Li, Meng, et al.
Published: (2026)

General Procedure to Provide High-Probability Guarantees for Stochastic Saddle Point Problems
by: Li, Dongyang, et al.
Published: (2024)

Novel Optimization Techniques for Parameter Estimation
by: Wu, Chenyu, et al.
Published: (2024)

A General Tikhonov Regularized Second-Order Dynamical System for Convex-Concave Bilinear Saddle Point Problems
by: Zhang, Bohan, et al.
Published: (2026)

History-Aware Adaptive High-Order Tensor Regularization
by: He, Chang, et al.
Published: (2025)

First-Order Algorithms Without Lipschitz Gradient: A Sequential Local Optimization Approach
by: Zhang, Junyu, et al.
Published: (2020)

Proximal Point Method for Online Saddle Point Problem
by: Meng, Qing-xin, et al.
Published: (2024)

On the Complexity of Lower-Order Implementations of Higher-Order Methods
by: Doikov, Nikita, et al.
Published: (2025)

Convex Synthesis of First-Order Methods for Time-Varying Smooth Strongly Convex Optimization
by: Van Scoy, Bryan, et al.
Published: (2026)

Robust Accelerated Primal-Dual Methods for Computing Saddle Points
by: Zhang, Xuan, et al.
Published: (2021)

Improved Iteration Complexity in Black-Box Optimization Problems under Higher Order Smoothness Function Condition
by: Lobanov, Aleksandr
Published: (2024)

Primal-dual Accelerated Mirror-Descent Method for Constrained Bilinear Saddle-Point Problems
by: Li, Weijian, et al.
Published: (2024)

Non-Stationary Bandit Convex Optimization: An Optimal Algorithm with Two-Point Feedback
by: He, Chang, et al.
Published: (2025)

Double Variance Reduction: A Smoothing Trick for Composite Optimization Problems without First-Order Gradient
by: Di, Hao, et al.
Published: (2024)

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions
by: Van Scoy, Bryan, et al.
Published: (2025)

On Relatively Smooth Optimization over Riemannian Manifolds
by: He, Chang, et al.
Published: (2025)

First-Order Methods for Linear Programming
by: Lu, Haihao
Published: (2024)

Efficiently Escaping Saddle Points under Generalized Smoothness via Self-Bounding Regularity
by: Cao, Daniel Yiming, et al.
Published: (2025)

An LP-Based Approach for Bilinear Saddle Point Problem with Instance-dependent Guarantee and Noisy Feedback
by: Jiang, Jiashuo, et al.
Published: (2026)

An Error Analysis of Second Order Elliptic Optimal Control Problem via Hybrid Higher Order Methods
by: Mallik, Gouranga, et al.
Published: (2025)

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

On Solving Minimization and Min-Max Problems by First-Order Methods with Relative Error in Gradients
by: Vasin, Artem, et al.
Published: (2025)

First-Order Methods for Linearly Constrained Bilevel Optimization
by: Kornowski, Guy, et al.
Published: (2024)

Power of Generalized Smoothness in Stochastic Convex Optimization: First- and Zero-Order Algorithms
by: Lobanov, Aleksandr, et al.
Published: (2025)

A Randomized Block-Coordinate Primal-Dual Method for Large-scale Stochastic Saddle Point Problems
by: Hamedani, Erfan Yazdandoost, et al.
Published: (2019)

Higher-Order Newton Methods with Polynomial Work per Iteration
by: Ahmadi, Amir Ali, et al.
Published: (2023)

On the Nature of Regularity Assumptions in Bilevel Optimization with Constrained Lower-level Problem
by: Jiang, Xiaotian, et al.
Published: (2026)

An Invitation to Higher-Order Riemannian Optimization: Optimal and Implementable Methods
by: Gutman, David Huckleberry, et al.
Published: (2026)

Verification of First-Order Methods for Parametric Quadratic Optimization
by: Ranjan, Vinit, et al.
Published: (2024)

A Generalized Primal-Dual Correction Method for Saddle-Point Problems with a Nonlinear Coupling Operator
by: Wang, Sai, et al.
Published: (2023)

A Saddle Point Algorithm for Robust Data-Driven Factor Model Problems
by: Khodakaramzadeh, Shabnam, et al.
Published: (2025)

First Order Algorithm on an Optimization Problem with Improved Convergence when Problem is Convex
by: Sim, Chee-Khian
Published: (2025)

Clipped Stochastic Gradient Tracking For Locally Smooth Functions
by: Mei, Leilei, et al.
Published: (2026)

Successive Fixing for Large-Scale SCUC Using First-Order Methods
by: Xiong, Jinxin, et al.
Published: (2025)

A Triple-Bregman Balanced Primal-Dual Algorithm for Saddle Point Problems
by: Yu, Jintao, et al.
Published: (2025)

Efficient Gradient Methods for Distributed Saddle Problems
by: Luo, Ruichen, et al.
Published: (2026)

Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems
by: Shen, Yiyang, et al.
Published: (2026)

First- and Second-Order Analysis for Optimization Problems with Manifold-Valued Constraints
by: Bergmann, Ronny, et al.
Published: (2021)