Image de couverture de livre

On Convergence of Regularized Barzilai-Borwein Method

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Xu, Xin
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control 90C20, 90C25, 90C30
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Regularized Barzilai-Borwein method
par: An, Congpei, et autres
Publié: (2022)

A Parameterized Barzilai-Borwein Method via Interpolated Least Squares
par: Xu, Xin
Publié: (2024)

A Subspace Minimization Barzilai-Borwein Method for Multiobjective Optimization Problems
par: Chen, Jian, et autres
Publié: (2024)

Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices
par: Ou, Hongjia, et autres
Publié: (2024)

Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
par: Zhu, Zhihan, et autres
Publié: (2024)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
par: Mannel, Florian
Publié: (2024)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
par: Giang-Tran, Khanh-Hung, et autres
Publié: (2025)

A Modified Proximal Bundle Method Under A Frank-Wolfe Perspective
par: Fersztand, David, et autres
Publié: (2024)

Parallelizing the Circumcentered-Reflection Method
par: Barros, Pablo, et autres
Publié: (2025)

An adaptive ADMM with regularized spectral penalty for sparse portfolio selection
par: Xu, Xin
Publié: (2025)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
par: Wang, Alex L.
Publié: (2025)

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
par: van Treek, Kira, et autres
Publié: (2025)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
par: Giang-Tran, Khanh-Hung, et autres
Publié: (2023)

Lipschitz-free Projected Subgradient Method with Time-varying Step-size
par: Xia, Yong, et autres
Publié: (2024)

Triangle Steepest Descent: A Geometry-Based Gradient Algorithm with Guaranteed R-Linear Convergence
par: Shen, Ya, et autres
Publié: (2025)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
par: Tauheed, et autres
Publié: (2026)

A nonsmooth Frank-Wolfe algorithm through a dual cutting-plane approach
par: Mazanti, Guilherme, et autres
Publié: (2024)

Nesterov's accelerated gradient for unbounded convex functions finds the minimum-norm point in the dual space
par: Sakabe, Keiya
Publié: (2026)

Gaussian smoothing gradient descent for minimizing functions (GSmoothGD)
par: Starnes, Andrew, et autres
Publié: (2023)

Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization
par: Hamana, Shodai, et autres
Publié: (2026)

Solving Sparsity Constrained PCA, Regression, and QCQP via the Spartrahedron
par: Cifuentes, Diego, et autres
Publié: (2026)

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
par: Lin, Zhenwei, et autres
Publié: (2022)

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
par: Hou, Di, et autres
Publié: (2025)

A Globally Convergent Gradient Method with Momentum
par: Lapucci, Matteo, et autres
Publié: (2024)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
par: Zhang, Liwei, et autres
Publié: (2025)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
par: Kojima, Masakazu, et autres
Publié: (2025)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
par: Kojima, Masakazu, et autres
Publié: (2025)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
par: Arima, Naohiko, et autres
Publié: (2023)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
par: Arima, Naohiko, et autres
Publié: (2024)

Separable QCQPs and Their Exact SDP Relaxations
par: Kojima, Masakazu, et autres
Publié: (2026)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
par: Göß, Adrian
Publié: (2026)

Parabolic Approximation & Relaxation for MINLP
par: Göß, Adrian, et autres
Publié: (2024)

Hidden convexity of quadratic systems and its application to quadratic programming
par: Huy, Nguyen Quang, et autres
Publié: (2026)

Adaptive Inertial Method
par: Long, Han, et autres
Publié: (2025)

Long-Step Path-Following Algorithm for Quantum Information Theory: Some Numerical Aspects and Applications
par: Faybusovich, Leonid, et autres
Publié: (2019)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
par: Chen, Kaihuang, et autres
Publié: (2025)

Entropic Risk-Averse Generalized Momentum Methods
par: Can, Bugra, et autres
Publié: (2022)

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

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
par: Gómez-Casares, Ignacio, et autres
Publié: (2025)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
par: Aguirre, Jacob M., et autres
Publié: (2025)