scientific article
From MaRDI portal
Publication:3549682
zbMath1231.68283MaRDI QIDQ3549682
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Optimal column subset selection for image classification by genetic algorithms ⋮ Mixed integer second-order cone programming formulations for variable selection in linear regression ⋮ Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice ⋮ A polynomial case of the cardinality-constrained quadratic optimization problem ⋮ A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems ⋮ Structured Robust Submodular Maximization: Offline and Online Algorithms ⋮ Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint ⋮ Sparse approximation over the cube ⋮ A graph-based decomposition method for convex quadratic optimization with indicators ⋮ Improved deterministic algorithms for non-monotone submodular maximization ⋮ Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity ⋮ Improved deterministic algorithms for non-monotone submodular maximization ⋮ Group fairness in non-monotone submodular maximization ⋮ A note on the hardness of sparse approximation ⋮ Sparse approximation based on a random overcomplete basis ⋮ Scalable Algorithms for the Sparse Ridge Regression ⋮ Unnamed Item ⋮ Subset Selection in Sparse Matrices ⋮ Maximum relevance minimum common redundancy feature selection for nonlinear data ⋮ Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios ⋮ Unnamed Item ⋮ Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice ⋮ Unnamed Item ⋮ Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint
This page was built for publication:
