Adaptive algorithms for relatively Lipschitz continuous convex optimization problems

zbMATH Open1527.90163arXiv2107.05765MaRDI QIDQ6083643FDOQ6083643

Authors: F. S. Stonyakin, Mohammad S. Alkousa, Alexander A. Titov, A. V. Gasnikov 

Publication date: 8 December 2023

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

Recommendations

• Adaptive mirror descent algorithms for convex and strongly convex optimization problems with functional constraints
• Analogues of switching subgradient schemes for relatively Lipschitz-continuous convex programming problems
• On modification of an adaptive stochastic mirror descent algorithm for convex optimization problems with functional constraints
• Mirror descent and convex optimization problems with non-smooth inequality constraints
• Some adaptive first-order methods for variational inequalities with relatively strongly monotone operators and generalized smoothness

zbMATH Keywords

convex optimizationvariational inequalityadaptive methodrelative boundednessrelative smoothnessrelative Lipschitz continuityrelative strong convexity

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Complexity and performance of numerical algorithms (65Y20) Large-scale problems in mathematical programming (90C06) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Cited In (5)

• Structural adaptation via \(\mathbb L_p\)-norm oracle inequalities
• Title not available (Why is that?)
• Efficient and adaptive Lagrange-multiplier methods for nonlinear continuous global optimization
• Title not available (Why is that?)
• Exact Lipschitz regularization of convex optimization problems

This page was built for publication: Adaptive algorithms for relatively Lipschitz continuous convex optimization problems

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