Cover Image

Subspace Quasi-Newton Method with Gradient Approximation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Miyaishi, Taisei, Nozawa, Ryota, Poirion, Pierre-Louis, Takeda, Akiko
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization
by: Nozawa, Ryota, et al.
Published: (2024)

Random-Subspace Frank--Wolfe over Strongly Convex Sets
by: Poirion, Pierre-Louis, et al.
Published: (2026)

Theoretical analysis of the randomized subspace regularized Newton method for non-convex optimization
by: Fuji, Terunari, et al.
Published: (2022)

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

Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
by: Han, Andi, et al.
Published: (2025)

Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems
by: Nishijima, Mitsuhiro, et al.
Published: (2025)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
by: Higuchi, Rei, et al.
Published: (2024)

Convergence Analysis of Randomized Subspace Normalized SGD under Heavy-Tailed Noise
by: Omiya, Gaku, et al.
Published: (2026)

Sparse Sub-gaussian Random Projections for Semidefinite Programming Relaxations
by: Guedes-Ayala, Monse, et al.
Published: (2024)

Fairness in Robust Unit Commitment Problem Considering Suppression of Renewable Energy
by: Toyoshima, Ichiro, et al.
Published: (2026)

Practical Regularized Quasi-Newton Methods with Inexact Function Values
by: Hamaguchi, Hiroki, et al.
Published: (2026)

Zeroth-order Gradient and Quasi-Newton Methods for Nonsmooth Nonconvex Stochastic Optimization
by: Marrinan, Luke, et al.
Published: (2023)

Approximate Bregman proximal gradient algorithm with variable metric Armijo--Wolfe line search
by: Fujiki, Kiwamu, et al.
Published: (2025)

Approximate Bregman Proximal Gradient Algorithm for Relatively Smooth Nonconvex Optimization
by: Takahashi, Shota, et al.
Published: (2023)

Quasi-Quadratic Gradient: A New Direction for Accelerating the BFGS Method in Quasi-Newton Optimization
by: Chiang, John
Published: (2026)

Subspace Newton's Method for $\ell_0$-Regularized Optimization Problems with Box Constraint
by: Ye, Yuge, et al.
Published: (2025)

Novel Limited Memory Quasi-Newton Methods Based On Optimal Matrix Approximation
by: Berglund, Erik, et al.
Published: (2024)

Exploring Jacobian Inexactness in Second-Order Methods for Variational Inequalities: Lower Bounds, Optimal Algorithms and Quasi-Newton Approximations
by: Agafonov, Artem, et al.
Published: (2024)

A Decentralized Primal-Dual Method with Quasi-Newton Tracking
by: Wang, Liping, et al.
Published: (2023)

Quasi-Newton Methods for Topology Optimization Using a Level-Set Method
by: Blauth, Sebastian, et al.
Published: (2023)

A Quasi-Newton Subspace Trust Region Algorithm for nonmonotone variational inequalities in adversarial learning over box constraints
by: Qiu, Zicheng, et al.
Published: (2023)

Efficient Gradient-Enhanced Bayesian Optimizer with Comparisons to Conjugate-Gradient and Quasi-Newton Optimizers for Unconstrained Local Optimization
by: Marchildon, André L., et al.
Published: (2025)

Theoretical smoothing frameworks for nonsmooth simple bilevel problems
by: Alcantara, Jan Harold, et al.
Published: (2024)

Computing local minimizers in polynomial optimization under genericity conditions
by: Hieu, Vu Trung, et al.
Published: (2023)

Sharpened Lazy Incremental Quasi-Newton Method
by: Lahoti, Aakash, et al.
Published: (2023)

Advancing Multi-Secant Quasi-Newton Methods for General Convex Functions
by: Lee, Mokhwa, et al.
Published: (2025)

Distributed Quasi-Newton Method for Multi-Agent Optimization
by: Shorinwa, Ola, et al.
Published: (2024)

On Some Versions of Subspace Optimization Methods with Inexact Gradient Information
by: Kuruzov, Ilya, et al.
Published: (2024)

Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity
by: Chen, Lesi, et al.
Published: (2025)

Inertial Quasi-Newton Methods for Monotone Inclusion: Efficient Resolvent Calculus and Primal-Dual Methods
by: Wang, Shida, et al.
Published: (2022)

Statistical and Computational Complexities of BFGS Quasi-Newton Method for Generalized Linear Models
by: Jin, Qiujiang, et al.
Published: (2022)

A primal-dual interior point trust region method for second-order stationary points of Riemannian inequality-constrained optimization problems
by: Obara, Mitsuaki, et al.
Published: (2025)

Local near-quadratic convergence of Riemannian interior point methods
by: Obara, Mitsuaki, et al.
Published: (2025)

A Simple yet Highly Accurate Prediction-Correction Algorithm for Time-Varying Optimization
by: Kamijima, Tomoya, et al.
Published: (2025)

A Framework for Nonlinearly-Constrained Gradient-Enhanced Local Bayesian Optimization with Comparisons to Quasi-Newton Optimizers
by: Marchildon, André L., et al.
Published: (2025)

Mean-Field Analysis and Optimal Control of a Dynamic Rating and Matchmaking System
by: Nozawa, Wataru
Published: (2025)

General Proximal Quasi-Newton Methods based on model functions for nonsmooth nonconvex problems
by: Jia, Xiaoxi
Published: (2025)

Incremental Quasi-Newton Methods with Faster Superlinear Convergence Rates
by: Liu, Zhuanghua, et al.
Published: (2024)

Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees
by: Agafonov, Artem, et al.
Published: (2025)

Convergence Error Analysis of Reflected Gradient Langevin Dynamics for Globally Optimizing Non-Convex Constrained Problems
by: Sato, Kanji, et al.
Published: (2022)