Active-set Methods for Submodular Minimization Problems
From MaRDI portal
Publication:4637060
zbMath1451.90121arXiv1506.02852MaRDI QIDQ4637060
Francis Bach, K. S. Sesh Kumar
Publication date: 17 April 2018
Full work available at URL: https://arxiv.org/abs/1506.02852
convex optimizationdiscrete optimizationsubmodular function minimizationcut functionstotal variation denoising
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inference methods for CRFs with co-occurrence statistics
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Minimizing a sum of submodular functions
- Active set algorithms for isotonic regression; a unifying framework
- On total variation minimization and surface evolution using parametric maximum flows
- A cyclic projection algorithm via duality
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- Dykstra's alternating projection algorithm for two sets
- Estimation of the convergence rate of Dykstra's cyclic projections algorithm in polyhedral case
- Submodular functions and optimization.
- Parametric Maximum Flow Algorithms for Fast Total Variation Minimization
- Submodular systems and related topics
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions on General Weighted Graphs
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- Lx = b
- Learning with Submodular Functions: A Convex Optimization Perspective
- Balancing Applied to Maximum Network Flow Problems
