:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Shen, Ya, Li, Qing-Na, Dai, Yu-Hong
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C20 \and 90C25
Online Access:	https://arxiv.org/abs/2501.16731
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
by: van Treek, Kira, et al.
Published: (2025)

On Convergence of Regularized Barzilai-Borwein Method
by: Xu, Xin
Published: (2025)

Effective Front-Descent Algorithms with Convergence Guarantees
by: Lapucci, Matteo, et al.
Published: (2024)

Solving Sparsity Constrained PCA, Regression, and QCQP via the Spartrahedron
by: Cifuentes, Diego, et al.
Published: (2026)

An adaptive ADMM with regularized spectral penalty for sparse portfolio selection
by: Xu, Xin
Published: (2025)

A Parameterized Barzilai-Borwein Method via Interpolated Least Squares
by: Xu, Xin
Published: (2024)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
by: Bao, Chenglong, et al.
Published: (2024)

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
by: Chen, Kaihuang, et al.
Published: (2025)

On Averaging and Extrapolation for Gradient Descent
by: Luner, Alan, et al.
Published: (2024)

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
by: Arima, Naohiko, et al.
Published: (2023)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
by: Arima, Naohiko, et al.
Published: (2024)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
by: Kojima, Masakazu, et al.
Published: (2025)

Separable QCQPs and Their Exact SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2025)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
by: Bousselmi, Nizar, et al.
Published: (2023)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
by: Giang-Tran, Khanh-Hung, et al.
Published: (2025)

Greedy Learning to Optimize with Convergence Guarantees
by: Fahy, Patrick, et al.
Published: (2024)

HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming
by: Chen, Kaihuang, et al.
Published: (2025)

Solving Min-Cost Concave Generalized Dynamic Flows and Approximating Dynamic Optimal Power Flows
by: Rothschild, Jacob H.
Published: (2024)

On $O(n)$ Algorithms for Projection onto the Top-$k$-sum Sublevel Set
by: Roth, Jake, et al.
Published: (2023)

Extended Triangle Inequalities for Nonconvex Box-Constrained Quadratic Programming
by: Anstreicher, Kurt M., et al.
Published: (2025)

Regularized Barzilai-Borwein method
by: An, Congpei, et al.
Published: (2022)

Stochastic versus Deterministic in Stochastic Gradient Descent
by: Li, Runze, et al.
Published: (2025)

Structure, Analysis, and Synthesis of First-Order Algorithms
by: Miller, Jared, et al.
Published: (2026)

A Riemannian Accelerated Proximal Gradient Method
by: Feng, Shuailing, et al.
Published: (2025)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
by: Chen, Kaihuang, et al.
Published: (2025)

Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
by: Zhu, Zhihan, et al.
Published: (2024)

HPR-LP: An implementation of an HPR method for solving linear programming
by: Chen, Kaihuang, et al.
Published: (2024)

Local and Global Convergence of Greedy Parabolic Target-Following Methods for Linear Programming
by: Nesterov, Yurii
Published: (2024)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
by: Namchaisiri, Charles, et al.
Published: (2024)

Randomized Subspace Nesterov Accelerated Gradient
by: Omiya, Gaku, et al.
Published: (2026)

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
by: Gu, Ran, et al.
Published: (2021)

Tight Semidefinite Relaxations for Verifying Robustness of Neural Networks
by: Azuma, Godai, et al.
Published: (2025)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
by: Tauheed, et al.
Published: (2026)

A symmetric primal-dual algorithmic framework for saddle point problems
by: He, Hongjin, et al.
Published: (2022)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
by: Rubbens, Anne, et al.
Published: (2024)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
by: Nishioka, Akatsuki, et al.
Published: (2023)

Generalized Steepest Descent Methods on Riemannian Manifolds and Hilbert Spaces: Convergence Analysis and Stochastic Extensions
by: A., Rashid, et al.
Published: (2025)

Gaussian smoothing gradient descent for minimizing functions (GSmoothGD)
by: Starnes, Andrew, et al.
Published: (2023)