Adaptive subgradient methods for mathematical programming problems with quasiconvex functions

DOI10.1134/S0081543823060019MaRDI QIDQ6154812zbMATH OpenFDO

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)

Full work available at URL https://doi.org/10.1134/S0081543823060019

zbMATH Keywords

adaptive methodquasiconvex functionrestartssharp minimumsubgradient method

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 4063877 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3282977 (Why is no real title available?)
• scientific article; zbMATH DE number 3304564 (Why is no real title available?)
• Mirror descent and convex optimization problems with non-smooth inequality constraints
• Optimization and nonsmooth analysis
• Subgradient methods for huge-scale optimization problems

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)