Geometric Rescaling Algorithms for Submodular Function Minimization (Q4958557): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Learning with Submodular Functions: A Convex Optimization Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Rescaled Perceptron Algorithm for Conic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic submodular function minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescaling Algorithms for Linear Conic Feasibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple polynomial-time rescaling algorithm for solving linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on submodular function minimization by Chubanov's LP algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3076645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A descent method for submodular function minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5405212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved deterministic rescaling for linear programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Scaling Algorithm for Minimizing Submodular Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster strongly polynomial time algorithm for submodular function minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic rescaled perceptron algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nearest point in A polytope / rank
 
Normal rank

Revision as of 14:29, 26 July 2024

scientific article; zbMATH DE number 7395112
Language Label Description Also known as
English
Geometric Rescaling Algorithms for Submodular Function Minimization
scientific article; zbMATH DE number 7395112

    Statements

    Geometric Rescaling Algorithms for Submodular Function Minimization (English)
    0 references
    0 references
    0 references
    0 references
    14 September 2021
    0 references
    submodular function minimization
    0 references
    gradient methods
    0 references
    rescaling
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers