Stochastic block-coordinate gradient projection algorithms for submodular maximization

DOI10.1155/2018/2609471MaRDI QIDQ1723100zbMATH OpenOpenAlexWikidataFDO

Authors Zhigang Li, Mingchuan Zhang, Junlong Zhu, Ruijuan Zheng, Qikun Zhang, Qingtao Wu

Publication date 19 February 2019

Published in Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2018/2609471

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Stochastic conditional gradient methods: from convex minimization to submodular maximization
• scientific article; zbMATH DE number 7255156
• An accelerated continuous greedy algorithm for maximizing strong submodular functions
• Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization
• Stochastic-lazier-greedy algorithm for monotone non-submodular maximization

Cites work

• scientific article; zbMATH DE number 6378119 (Why is no real title available?)
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 3635849 (Why is no real title available?)
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
• A coordinate gradient descent method for nonsmooth separable minimization
• A faster strongly polynomial time algorithm for submodular function minimization
• Accelerated block-coordinate relaxation for regularized optimization
• Adaptive submodularity: theory and applications in active learning and stochastic optimization
• An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
• An analysis of approximations for maximizing submodular set functions—I
• Asynchronous stochastic coordinate descent: parallelism and convergence properties
• Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
• Convergence of a block coordinate descent method for nondifferentiable minimization
• Coordinate descent algorithms for lasso penalized regression
• Coordinate descent method for large-scale L2-loss linear support vector machines
• Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
• Efficiency of coordinate descent methods on huge-scale optimization problems
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
• Maximizing Non-monotone Submodular Functions
• Maximizing a monotone submodular function subject to a matroid constraint
• On multiplicative weight updates for concave and submodular function maximization
• On the complexity analysis of randomized block-coordinate descent methods
• On the convergence of the coordinate descent method for convex differentiable minimization
• Submodular Utility Maximization for Deadline Constrained Data Collection in Sensor Networks
• Submodular function maximization via the multilinear relaxation and contention resolution schemes
• Submodular function maximization via the multilinear relaxation and contention resolution schemes
• Submodular functions and optimization.
• Submodular functions: from discrete to continuous domains

Cited in

(2)

• Stochastic conditional gradient methods: from convex minimization to submodular maximization
• Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization

This page was built for publication: Stochastic block-coordinate gradient projection algorithms for submodular maximization

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