Global approximation of local optimality: nonsubmodular optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 429516 (Why is no real title available?)
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A convergence theorem of Rosen’s gradient projection method
- A faster strongly polynomial time algorithm for submodular function minimization
- A framework of discrete DC programming by discrete convex analysis
- A semantic relatedness preserved subset extraction method for language corpora based on pseudo-Boolean optimization
- An analysis of approximations for maximizing submodular set functions—I
- An analysis of the greedy algorithm for the submodular set covering problem
- Blocking rumor by cut
- Continuous relaxation for discrete DC programming
- Discrete Convex Analysis
- Geometric algorithms and combinatorial optimization
- Global convergence of Rosen's gradient projection method
- Interaction-aware influence maximization and iterated sandwich method
- Mathematical theory of optimization
- Non-monotone submodular maximization under matroid and knapsack constraints
- On the complexity of approximating a KKT point of quadratic programming
- Optimal approximation for submodular and supermodular optimization with bounded curvature
- Set function optimization
- Simple Local Search Problems that are Hard to Solve
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
- Speech corpora subset selection based on time-continuous utterances features
- Submodular Approximation: Sampling-based Algorithms and Lower Bounds
- Submodular functions and optimization.
- Welfare maximization and the supermodular degree
This page was built for publication: Global approximation of local optimality: nonsubmodular optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6934535)
