Cover Image

Krylov Subspace Acceleration for First-Order Splitting Methods in Convex Quadratic Programming

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pereira, Gabriel Berk, Goulart, Paul J.
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 65K05 (Primary) 90-08 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Massively Parallel Interior-Point Method for Arrowhead Linear Programs with Local Linking Structure
by: Kempke, Nils-Christian, et al.
Published: (2024)

A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions
by: Bao, Chenglong, et al.
Published: (2025)

Strong Convergence of FISTA for Affinely Constrained Convex Quadratic Minimization
by: Bartz, Sedi, et al.
Published: (2026)

Accelerated-gradient-based generalized Levenberg--Marquardt method with oracle complexity bound and local quadratic convergence
by: Marumo, Naoki, et al.
Published: (2022)

A Near-Optimal Total Complexity for the Inexact Accelerated Proximal Gradient Method via Quadratic Growth
by: Li, Hongda, et al.
Published: (2026)

A divergence-based condition to ensure quantile improvement in black-box global optimization
by: Guilmeau, Thomas, et al.
Published: (2024)

Parameter-free accelerated gradient descent for nonconvex minimization
by: Marumo, Naoki, et al.
Published: (2022)

A Flexible Algorithmic Framework for Strictly Convex Quadratic Minimization
by: MacDonald, Liam, et al.
Published: (2025)

Learning to Choose Branching Rules for Nonconvex MINLPs
by: Berthold, Timo, et al.
Published: (2026)

A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints
by: Adeoye, Adeyemi D., et al.
Published: (2025)

Accelerated Proximal Gradient Methods in the affine-quadratic case: Strong convergence and limit identification
by: Moursi, Walaa M., et al.
Published: (2025)

Relaxed Weak Accelerated Proximal Gradient Method: a Unified Framework for Nesterov's Accelerations
by: Li, Hongda, et al.
Published: (2025)

A Dual Method for Minimax Quadratic Programming
by: Ren, Wenhui, et al.
Published: (2025)

$Q$-fully Quadratic Modeling and its Application in a Random Subspace Derivative-free Method
by: Chen, Yiwen, et al.
Published: (2023)

Optimization in complex spaces with the Mixed Newton Method
by: Bakhurin, Sergey, et al.
Published: (2022)

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

Algebraic solutions of tropical optimization problems
by: Krivulin, N.
Published: (2014)

Heavy-ball Differential Equation Achieves $O(\varepsilon^{-7/4})$ Convergence for Nonconvex Functions
by: Okamura, Kaito, et al.
Published: (2024)

Global optimization of multivariable functions satisfying the Vanderbei condition
by: Arutyunova, Natalya, et al.
Published: (2019)

A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming
by: Huo, Xinyue, et al.
Published: (2024)

Accelerated Gradient Methods for Nonconvex Optimization: Escape Trajectories From Strict Saddle Points and Convergence to Local Minima
by: Dixit, Rishabh, et al.
Published: (2023)

A Primal-Dual Gradient Descent Approach to the Connectivity Constrained Sensor Coverage Problem
by: Agerman, Mathias Bock, et al.
Published: (2025)

Time-integrated Optimal Transport: A Robust Minimax Framework
by: Nguyen, Thai P. D., et al.
Published: (2025)

Trust-region filter algorithms utilizing Hessian information for gray-box optimization
by: Hameed, Gul, et al.
Published: (2025)

Mixed Newton Method for Optimization in Complex Spaces
by: Yudin, Nikita, et al.
Published: (2024)

A Barrier-Metric First-Order Method for Linearly Constrained Bilevel Optimization
by: Hong, Tenglong, et al.
Published: (2026)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
by: Chen, Jian, et al.
Published: (2026)

Distributed Parallel Structure-Aware Presolving for Arrowhead Linear Programs
by: Kempke, Nils-Christian, et al.
Published: (2026)

Efficiency and Convergence Insights in Large-Scale Optimization Using the Improved Inexact-Newton-Smart Algorithm and Interior-Point Framework
by: Renani, Neda Bagheri, et al.
Published: (2025)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
by: Xie, Lijun, et al.
Published: (2025)

Understanding FISTA's weak convergence: A step-by-step introduction to the 2025 milestone
by: Bauschke, Heinz H., et al.
Published: (2026)

Semi-Monotone Goldstein Line Search Strategy with Application in Sparse Recovery
by: Shabani, Shima, et al.
Published: (2025)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
by: Bao, Chenglong, et al.
Published: (2023)

Dynamic FISTA for Convex Composite Bi-Level Optimization
by: Merchav, Roey, et al.
Published: (2024)

Asymptotic Linear Convergence of ADMM for Isotropic TV Norm Compressed Sensing
by: Torres, Emmanuel Gil, et al.
Published: (2025)

Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods
by: Ahookhosh, Masoud, et al.
Published: (2026)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
by: Marumo, Naoki
Published: (2025)

Fidelity and interruption control for expensive constrained multi-fidelity blackbox optimization
by: Alarie, Stéphane, et al.
Published: (2023)

A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems
by: Qiu, Songqiang, et al.
Published: (2023)

Fisher-Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients
by: Müller, Johannes, et al.
Published: (2024)