Errors of gradient extrema of a strictly convex function of discrete argument

DOI10.1515/DMA.1992.2.2.119MaRDI QIDQ4284965zbMATH OpenOpenAlexFDO

Authors Michail M. Kovalev, A. B. Ramazanov, V. A. Emelichev

Publication date 27 March 1994

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1992.2.2.119

zbMATH Keywords

greedy algorithmstrictly convex functions

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 4193456
• scientific article; zbMATH DE number 942502
• Gradient Convergence in Gradient methods with Errors
• Optimal inequalities for the convex combination of error function
• Gradient methods of maximization of convex functions on discrete structures
• Explicit and efficient error estimation for convex minimization problems
• On numerical estimates of errors in solving convex optimization problems
• The extragradient method for convex optimization in the presence of computational errors
• Error Bounds for Least Squares Gradient Estimates
• From error bounds to the complexity of first-order descent methods for convex functions

Cited in

(2)

• scientific article; zbMATH DE number 7671922 (Why is no real title available?)
• On stability of the gradient algorithm in convex discrete optimisation problems and related questions

This page was built for publication: Errors of gradient extrema of a strictly convex function of discrete argument

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