Cover Image

Riemannian Inexact Gradient Descent for Quadratic Discrimination

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Talwar, Uday, Kupinski, Meredith K., Jalilzadeh, Afrooz
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Convergence Analysis of Non-Strongly-Monotone Stochastic Quasi-Variational Inequalities
by: Alizadeh, Zeinab, et al.
Published: (2024)

Linear Convergence of a Unified Primal--Dual Algorithm for Convex--Concave Saddle Point Problems with Quadratic Growth
by: Melcher, Cody, et al.
Published: (2025)

Distributionally Robust Nash Equilibria via Variational Inequalities
by: Alizadeh, Zeinab, et al.
Published: (2025)

Variance-reduction for Variational Inequality Problems with Bregman Distance Function
by: Alizadeh, Zeinab, et al.
Published: (2024)

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

Semi-infinite Nonconvex Constrained Min-Max Optimization
by: Melcher, Cody, et al.
Published: (2025)

On the Analysis of Misspecified Variational Inequalities with Nonlinear Constraints
by: Dey, Novel Kumar, et al.
Published: (2026)

A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization
by: Khanh, Pham Duy, et al.
Published: (2023)

Convergence and Trade-Offs in Riemannian Gradient Descent and Riemannian Proximal Point
by: Martínez-Rubio, David, et al.
Published: (2024)

Convergence of First-Order Algorithms with Momentum from the Perspective of an Inexact Gradient Descent Method
by: Khanh, Pham Duy, et al.
Published: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

Adaptive Gradient Descent on Riemannian Manifolds with Nonnegative Curvature
by: Ansari-Önnestam, Aban, et al.
Published: (2025)

IRKA is a Riemannian Gradient Descent Method
by: Mlinarić, Petar, et al.
Published: (2023)

On a Family of Relaxed Gradient Descent Methods for Quadratic Minimization
by: MacDonald, Liam, et al.
Published: (2024)

An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization
by: Jiang, Bo, et al.
Published: (2025)

Analysis of Gradient Descent with Varying Step Sizes using Integral Quadratic Constraints
by: Padmanabhan, Ram, et al.
Published: (2022)

On the Oracle Complexity of a Riemannian Inexact Augmented Lagrangian Method for Riemannian Nonsmooth Composite Problems
by: Xu, Meng, et al.
Published: (2024)

A Learning-Based Inexact ADMM for Solving Quadratic Programs
by: Gao, Xi, et al.
Published: (2025)

Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2025)

Inexact Augmented Lagrangian Methods for Conic Programs: Quadratic Growth and Linear Convergence
by: Liao, Feng-Yi, et al.
Published: (2024)

A Single-Mode Quasi Riemannian Gradient Descent Algorithm for Low-Rank Tensor Recovery
by: Zhang, Yuanwei, et al.
Published: (2024)

Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Size
by: Oowada, Kanata, et al.
Published: (2025)

An Inexact Conditional Gradient Method for Constrained Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2023)

Inexact Newton Methods for Solving Generalized Equations on Riemannian Manifolds
by: Louzeiro, Mauricio S., et al.
Published: (2023)

Bilevel Learning with Inexact Stochastic Gradients
by: Salehi, Mohammad Sadegh, et al.
Published: (2024)

Quadratic Gradient: A Unified Framework Bridging Gradient Descent and Newton-Type Methods by Synthesizing Hessians and Gradients
by: Chiang, John
Published: (2022)

Inexactly Smooth Performance Estimation and New Optimized Gradient Methods
by: Zoll, Aaron, et al.
Published: (2026)

A Relative Inexact Proximal Gradient Method with an Explicit Linesearch
by: Bello-Cruz, Yunier, et al.
Published: (2024)

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

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
by: Bastianello, Nicola, et al.
Published: (2020)

Frictionless Hamiltonian Descent and Coordinate Hamiltonian Descent for Strongly Convex Quadratic Problems
by: Wang, Jun-Kun
Published: (2024)

An Inexact General Descent Method with Applications in Differential Equation-Constrained Optimization
by: Macedo, Humberto Gimenes, et al.
Published: (2025)

Mirror Descent on Riemannian Manifolds
by: Jiang, Jiaxin, et al.
Published: (2026)

Efficient Gradient Tracking Algorithms for Distributed Optimization Problems with Inexact Communication
by: Zhao, Shengchao, et al.
Published: (2025)

Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms
by: Li, Yuchen, et al.
Published: (2024)

Lipschitz-Free Mirror Descent Methods for Relatively Strongly Convex Functions with/without Absolute and Relative Inexactness
by: Alkousa, Mohammad S., et al.
Published: (2026)

Natural Gradient Descent for Control
by: Esmzad, Ramin, et al.
Published: (2025)

A Riemannian Alternating Descent Ascent Algorithmic Framework for Nonconvex-Linear Minimax Problems on Riemannian Manifolds
by: Xu, Meng, et al.
Published: (2024)

Computing Equilibria in Stochastic Nonconvex and Non-monotone Games via Gradient-Response Schemes
by: Xiao, Zhuoyu, et al.
Published: (2025)

Interpretable Gradient Descent for Kalman Gain
by: Belabbas, M. A., et al.
Published: (2025)