Gradient methods of maximization of convex functions on discrete structures

DOI10.1007/BF01069426MaRDI QIDQ3747234zbMATH OpenOpenAlexFDO

Authors Michail M. Kovalev

Publication date 1985

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01069426

zbMATH Keywords

gradient methodsconvex discrete optimizationintegral programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10)

Recommendations

• On stability of the gradient algorithm in convex discrete optimisation problems and related questions
• scientific article; zbMATH DE number 4193456
• scientific article; zbMATH DE number 7671922
• scientific article; zbMATH DE number 175722
• On Steepest Descent Algorithms for Discrete Convex Functions

Cites work

• scientific article; zbMATH DE number 3843530 (Why is no real title available?)
• scientific article; zbMATH DE number 3854819 (Why is no real title available?)
• scientific article; zbMATH DE number 3817722 (Why is no real title available?)
• scientific article; zbMATH DE number 3828663 (Why is no real title available?)
• scientific article; zbMATH DE number 3898626 (Why is no real title available?)
• scientific article; zbMATH DE number 4075083 (Why is no real title available?)
• scientific article; zbMATH DE number 3674094 (Why is no real title available?)
• scientific article; zbMATH DE number 3726086 (Why is no real title available?)
• scientific article; zbMATH DE number 3751684 (Why is no real title available?)
• scientific article; zbMATH DE number 3616451 (Why is no real title available?)
• scientific article; zbMATH DE number 3795678 (Why is no real title available?)
• scientific article; zbMATH DE number 3801290 (Why is no real title available?)
• scientific article; zbMATH DE number 3892077 (Why is no real title available?)
• scientific article; zbMATH DE number 3390554 (Why is no real title available?)
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Finding feasible vectors of Edmonds-Giles polyhedra
• Lower bounds on the worst-case complexity of some oracle algorithms
• New applications of partial orders
• Polyhedral aspects of discrete optimization
• Zur mathematischen theorie der optimalen standardisierung

Cited in

(10)

• Estimates for the accuracy of solutions of discrete convex optimization problems obtained by a coordinatewise lifting algorithm
• Errors of gradient extrema of a strictly convex function of discrete argument
• scientific article; zbMATH DE number 7006375 (Why is no real title available?)
• scientific article; zbMATH DE number 7671922 (Why is no real title available?)
• Convolution operators conserving the property of the unimodality type for functions of one discrete variable
• Analysis of the error and stability of the gradient algorithm in the Jordan-Dedekind structures
• On Steepest Descent Algorithms for Discrete Convex Functions
• Gradient-Based Algorithms for Convex Discrete Optimization via Simulation
• scientific article; zbMATH DE number 2156771 (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: Gradient methods of maximization of convex functions on discrete structures

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