Time bounds of basic steepest descent algorithms for M-convex function minimization and related problems

MaRDI QIDQ5012285zbMATH OpenFDO

Authors Norito Minamikawa, Akiyoshi Shioura

Publication date 31 August 2021

zbMATH Keywords

analysis of algorithmdiscrete convex functiondiscrete optimizationsteepest descent method

Mathematics Subject Classification ID

Integer programming (90C10) Convex programming (90C25)

Recommendations

• On Steepest Descent Algorithms for Discrete Convex Functions
• scientific article; zbMATH DE number 1377657
• Minimization of an M-convex function
• Monotonicity in steepest ascent algorithms for polyhedral L-concave functions
• M-convex function minimization by continuous relaxation approach: proximity theorem and algorithm

Cited in

(7)

• Note on time bounds of two-phase algorithms for \(L\)-convex function minimization
• Monotonicity in steepest ascent algorithms for polyhedral L-concave functions
• On Steepest Descent Algorithms for Discrete Convex Functions
• Optimal general factor problem and jump system intersection
• Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids
• Optimal general factor problem and jump system intersection
• Steepest descent algorithm for M-convex function minimization using long step length

This page was built for publication: Time bounds of basic steepest descent algorithms for \(M\)-convex function minimization and related problems

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