Equivalence of convex minimization problems over base polytopes

DOI10.1007/S13160-012-0083-ZMaRDI QIDQ1926652zbMATH OpenOpenAlexFDO

Authors Kiyohito Nagano, Kazuyuki Aihara

Publication date 28 December 2012

Published in Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s13160-012-0083-z

zbMATH Keywords

combinatorial optimizationconvex optimizationsubmodular function

Mathematics Subject Classification ID

Convex programming (90C25) Combinatorial optimization (90C27) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40)

Recommendations

• On Convex Minimization over Base Polytopes
• scientific article; zbMATH DE number 647670
• scientific article; zbMATH DE number 3873086
• scientific article; zbMATH DE number 4137537
• Decreasing minimization on base-polyhedra: relation between discrete and continuous cases

Cites work

• scientific article; zbMATH DE number 5485471 (Why is no real title available?)
• A Concept of Egalitarianism Under Participation Constraints
• A Fast Parametric Maximum Flow Algorithm and Applications
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• A faster strongly polynomial time algorithm for submodular function minimization
• A push-relabel framework for submodular function minimization and applications to parametric optimization
• A strongly polynomial algorithm for line search in submodular polyhedra
• Approximation algorithms for prize collecting forest problems with submodular penalty functions
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization
• Finding the nearest point in A polytope
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
• NOTE ON THE UNIVERSAL BASES OF A PAIR OF POLYMATROIDS
• Network design for information networks
• Optimal flows in networks with multiple sources and sinks
• Submodular Function Minimization under Covering Constraints
• Submodular function minimization
• Submodular functions and optimization.
• Submodular systems and related topics
• The egalitarian solution and reduced game properties in convex games
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region

Cited in

(7)

• Minimax equalities by reconstruction of polytopes
• Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
• On Convex Minimization over Base Polytopes
• Machine speed scaling by adapting methods for convex optimization with submodular constraints
• A fast algorithm for quadratic resource allocation problems with nested constraints
• Lexicographically optimal earliest arrival flows
• On a Reduction for a Class of Resource Allocation Problems

This page was built for publication: Equivalence of convex minimization problems over base polytopes

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