Adaptive subgradient methods for mathematical programming problems with quasiconvex functions

DOI10.1134/S0081543823060019MaRDI QIDQ6154812FDOQ6154812

Authors: Seydamet S. Ablaev, F. S. Stonyakin, Mohammad S. Alkousa, A. V. Gasnikov 

Publication date: 16 February 2024

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Recommendations

• Convergence and efficiency of subgradient methods for quasiconvex minimization
• A subgradient projection method for quasiconvex minimization
• Subgradient methods for saddle point problems of quasiconvex optimization
• A subgradient method with non-monotone line search
• Adaptive subgradient method for the split quasi-convex feasibility problems

zbMATH Keywords

quasiconvex functionadaptive methodsubgradient methodsharp minimumrestarts

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Systems theory; control (93-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization and nonsmooth analysis
• Title not available (Why is that?)
• Subgradient methods for huge-scale optimization problems
• Title not available (Why is that?)
• Mirror descent and convex optimization problems with non-smooth inequality constraints

This page was built for publication: Adaptive subgradient methods for mathematical programming problems with quasiconvex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154812)