Solving convex min-min problems with smoothness and strong convexity in one group of variables and low dimension in the other

DOI10.1134/S0005117921100064zbMath1483.90111arXiv2102.00584OpenAlexW3217703422MaRDI QIDQ2069678

Alexander V. Gasnikov, E. Gladin, Mohammad S. Alkousa

Publication date: 21 January 2022

Published in: Automation and Remote Control (Search for Journal in Brave)

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

zbMATH Keywords

convex optimizationlogistic regressionvariance reductioncutting plane methodfast gradient methodVaidya's method

Mathematics Subject Classification ID

Convex programming (90C25)

Uses Software

• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Min-max and min-min Stackelberg strategies with closed-loop information structure
• A new algorithm for minimizing convex functions over convex sets
• Accelerated methods for saddle-point problem
• Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point
• First-order and stochastic optimization methods for machine learning

This page was built for publication: Solving convex min-min problems with smoothness and strong convexity in one group of variables and low dimension in the other