SLiSeS: Subsampled Line Search Spectral Gradient Method for Finite Sums

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bellavia, Stefania, Krejić, Nataša, Jerinkić, Nataša Krklec, Raydan, Marcos
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

SMOP: Stochastic trust region method for multi-objective problems
by: Krejić, Nataša, et al.
Published: (2025)

IPAS: An Adaptive Sample Size Method for Weighted Finite Sum Problems with Linear Equality Constraints
by: Krejić, Nataša, et al.
Published: (2025)

ASPEN: An Additional Sampling Penalty Method for Finite-Sum Optimization Problems with Nonlinear Equality Constraints
by: Krejić, Nataša, et al.
Published: (2025)

A Projected Stochastic Gradient Method for Finite-Sum Problems with Linear Equality Constraints
by: Jerinkic, Natasa Krklec, et al.
Published: (2026)

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
by: Krejić, Nataša, et al.
Published: (2025)

AN-SPS: Adaptive Sample Size Nonmonotone Line Search Spectral Projected Subgradient Method for Convex Constrained Optimization Problems
by: Jerinkić, Nataša Krklec, et al.
Published: (2022)

A non-monotone trust-region method with noisy oracles and additional sampling
by: Krejic, Natasa, et al.
Published: (2023)

ASMOP: Additional sampling stochastic trust region method for multi-objective problems
by: Jerinkić, Nataša Krklec, et al.
Published: (2025)

Distributed Inexact Newton Method with Adaptive Step Sizes
by: Jakovetic, Dusan, et al.
Published: (2023)

Parallel Inexact Levenberg-Marquardt Method for Nearly-Separable Nonlinear Least Squares
by: Fodor, Lidija, et al.
Published: (2023)

A discrete Consensus-Based Global Optimization Method with Noisy Objective Function
by: Bellavia, Stefania, et al.
Published: (2024)

ATE-SG: Alternate Through the Epochs Stochastic Gradient for Multi-Task Neural Networks
by: Bellavia, Stefania, et al.
Published: (2023)

A variable dimension sketching strategy for nonlinear least-squares
by: Bellavia, Stefania, et al.
Published: (2025)

An inexact alternating projection method with application to matrix completion
by: Bellavia, Stefania, et al.
Published: (2025)

Inexact Gauss-Newton methods with matrix approximation by sampling for nonlinear least-squares and systems
by: Bellavia, Stefania, et al.
Published: (2023)

Fully stochastic trust-region methods with Barzilai-Borwein steplengths
by: Bellavia, Stefania, et al.
Published: (2024)

Regularized methods via cubic model subspace minimization for nonconvex optimization
by: Bellavia, Stefania, et al.
Published: (2023)

Heat and mass transfer through fabric: a model for fabric drying with heated cylinders
by: Bellavia, Stefania, et al.
Published: (2026)

Method with Batching for Stochastic Finite-Sum Variational Inequalities in Non-Euclidean Setting
by: Pichugin, Alexander, et al.
Published: (2024)

Importance Sampling in Expensive Finite-Sum Optimization via Contextual Bandit Methods
by: Menickelly, Matt
Published: (2026)

Optimal Analysis of Method with Batching for Monotone Stochastic Finite-Sum Variational Inequalities
by: Pichugin, Alexander, et al.
Published: (2024)

A Relaxed Primal-Dual Hybrid Gradient Method with Line Search
by: McManus, Alex, et al.
Published: (2025)

Decentralized Stochastic Gradient Descent Ascent for Finite-Sum Minimax Problems
by: Gao, Hongchang
Published: (2022)

A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms
by: Goldshlager, Gil, et al.
Published: (2025)

The Essential Best and Average Rate of Convergence of the Exact Line Search Gradient Descent Method
by: Yu, Thomas
Published: (2023)

Greedy Newton: Newton's Method with Exact Line Search
by: Shea, Betty, et al.
Published: (2024)

Mean-field optimal control with stochastic leaders
by: Zimper, Sebastian, et al.
Published: (2025)

Adaptive Conditional Gradient Sliding: Projection-Free and Line-Search-Free Acceleration
by: Takahashi, Shota
Published: (2026)

An investigation of stochastic trust-region based algorithms for finite-sum minimization
by: Bellavia, Stefania, et al.
Published: (2024)

A Scaled Gradient Modified Non-monotone Line Search Method for Constrained Optimization Problems
by: Ansari, Qamrul Hasan, et al.
Published: (2026)

Koopman-Based Surrogate Models for Multi-Objective Optimization of Agent-Based Systems
by: Niemann, Jan-Hendrik, et al.
Published: (2023)

A Proximal Gradient Method with an Explicit Line search for Multiobjective Optimization
by: Bello-Cruz, Yunier, et al.
Published: (2024)

Spectral Preconditioning for Gradient Methods on Graded Non-convex Functions
by: Doikov, Nikita, et al.
Published: (2024)

Exploring an Alternative Line-Search Method for Lagrange-Newton Optimization
by: Möller, Ralf
Published: (2026)

A Spectral Projected Gradient Method for Computational Protein Design problem
by: Zheng, Yukai, et al.
Published: (2025)

On the Convergence and Complexity of the Stochastic Central Finite-Difference Based Gradient Estimation Methods
by: Bollapragada, Raghu, et al.
Published: (2025)

Decentralized Finite-Sum Optimization over Time-Varying Networks
by: Metelev, Dmitry, et al.
Published: (2024)

Adaptive Extrapolated Proximal Gradient Methods with Variance Reduction for Composite Nonconvex Finite-Sum Minimization
by: Yuan, Ganzhao
Published: (2025)

A Modified Dai-Liao Spectral Conjugate Gradient Method with an Application to Signal Processing
by: Sahu, D. R., et al.
Published: (2025)

A Non-Monotone Line-Search Method for Minimizing Functions with Spurious Local Minima
by: Aminifard, Zohreh, et al.
Published: (2025)