A submodular function minimization algorithm based on the minimum-norm base
From MaRDI portal
Publication:3076645
zbMATH Open1208.65086MaRDI QIDQ3076645FDOQ3076645
Authors: Satoru Fujishige, Shigueo Isotani 
Publication date: 23 February 2011
Recommendations
algorithmsnumerical examplescomplexitysubmodular functionsubmodular function minimizationbase polyhedroncombinatorial polynomial algorithmsminimum norm pointminimum-norm-point algorithm
Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Combinatorial optimization (90C27)
Cited In (15)
- Submodular function minimization
- A competitive solution for cooperative truckload delivery
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
- A descent method for submodular function minimization
- Quadratic decomposable submodular function minimization: theory and practice
- Stochastic conditional gradient methods: from convex minimization to submodular maximization
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization
- Geometric rescaling algorithms for submodular function minimization
- Structured sparsity: discrete and convex approaches
- An update-and-stabilize framework for the minimum-norm-point problem
- The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
- A new data-reusing algorithm based on minimum norm and minimum disturbance principles
- On a Reduction for a Class of Resource Allocation Problems
- Riemannian optimization via Frank-Wolfe methods
This page was built for publication: A submodular function minimization algorithm based on the minimum-norm base
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3076645)
