Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
From MaRDI portal
Publication:4785876
DOI10.1137/S1052623499352012zbMath1055.90053MaRDI QIDQ4785876
Publication date: 5 January 2003
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Convex programming (90C25) Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46)
Related Items (17)
Ameso optimization: a relaxation of discrete midpoint convexity ⋮ M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System ⋮ Scaling, proximity, and optimization of integrally convex functions ⋮ The b‐bibranching problem: TDI system, packing, and discrete convexity ⋮ Recent progress on integrally convex functions ⋮ Discrete Midpoint Convexity ⋮ An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint ⋮ Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization ⋮ Recent Developments in Discrete Convex Analysis ⋮ Application of M-convex submodular flow problem to mathematical economics ⋮ L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem ⋮ Applications of discrete convex analysis to mathematical economics ⋮ Coordinatewise domain scaling algorithm for M-convex function minimization ⋮ A capacity scaling algorithm for M-convex submodular flow ⋮ A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows ⋮ Directed discrete midpoint convexity ⋮ Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
This page was built for publication: Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
