scientific article; zbMATH DE number 3854819

MaRDI QIDQ3323714zbMATH OpenFDO

Authors E. T. Dimov, Michail M. Kovalev

Publication date 1984

zbMATH Keywords

convex separable functioncoordinate latticecurvature of intersection of independent setserror estimationgradient-type algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Recommendations

• New estimate for the curvature of an order-convex set and related questions
• scientific article; zbMATH DE number 4193487
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• Estimates for the accuracy of solutions of discrete convex optimization problems obtained by a coordinatewise lifting algorithm
• Publication:4888934

Cited in

(7)

• Convexity in ordered spaces
• On the order properties of digital curves in the pan-Euclidean geometry
• New applications of partial orders
• Gradient methods of maximization of convex functions on discrete structures
• scientific article; zbMATH DE number 919270 (Why is no real title available?)
• New estimate for the curvature of an order-convex set and related questions
• Lipschitz-Killing curvatures of angular partially ordered sets

This page was built for publication:

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