Sequential Subspace Optimization for Quasar-Convex Optimization Problems with Inexact Gradient

DOI10.1007/978-3-030-92711-0_2OpenAlexW3194383713MaRDI QIDQ5054156

Fedor S. Stonyakin, Ilya A. Kuruzov

Publication date: 29 November 2022

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.06297

zbMATH Keywords

subspace optimization methodinexact gradientquasar-convex functions

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (3)

Sequential Subspace Optimization for Quasar-Convex Optimization Problems with Inexact Gradient ⋮ Gradient-Type Methods for Optimization Problems with Polyak-Łojasiewicz Condition: Early Stopping and Adaptivity to Inexactness Parameter ⋮ Accelerated methods for weakly-quasi-convex optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• First-order methods of smooth convex optimization with inexact oracle
• Smooth Optimization with Approximate Gradient
• Gradient Descent Learns Linear Dynamical Systems
• Sequential Subspace Optimization for Quasar-Convex Optimization Problems with Inexact Gradient
• Accelerated methods for weakly-quasi-convex optimization problems

This page was built for publication: Sequential Subspace Optimization for Quasar-Convex Optimization Problems with Inexact Gradient