A framework of discrete DC programming by discrete convex analysis
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- scientific article; zbMATH DE number 4032473 (Why is no real title available?)
- scientific article; zbMATH DE number 16313 (Why is no real title available?)
- scientific article; zbMATH DE number 7051294 (Why is no real title available?)
- scientific article; zbMATH DE number 757676 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- A Fenchel-Rockafellar type duality theorem for maximization
- A duality principle for non-convex optimisation and the calculus of variations
- A faster strongly polynomial time algorithm for submodular function minimization
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming: overview.
- Dijkstra's algorithm and L-concave function maximization
- Discrete Convex Analysis
- Discrete convex analysis
- Generalized polymatroids and submodular flows
- Global minimization of a difference of two convex functions
- Matrices and matroids for systems analysis
- Matroid valuation on independent sets
- Maximizing Non-monotone Submodular Functions
- Maximizing a monotone submodular function subject to a matroid constraint
- Minimizing a Submodular Function on a Lattice
- New algorithms for convex cost tension problem with application to computer vision
- Non-monotone submodular maximization under matroid and knapsack constraints
- Nonlinear discrete optimization. An algorithmic theory
- Notes on L-/M-convex functions and the separation theorems
- On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application
- On difference convexity of locally Lipschitz functions
- On discrete Hessian matrix and convex extensibility
- On functions representable as a difference of convex functions
- Optimal approximation for the submodular welfare problem in the value oracle model
- Recent developments in discrete convex analysis
- Submodular containment is hard, even for networks
- Submodular function minimization
- Submodular functions and optimization.
- The Concave-Convex Procedure
- Valuated Matroid Intersection I: Optimality Criteria
- Valuated Matroid Intersection II: Algorithms
- Valuated matroids
- \(M\)-convex function on generalized polymatroid
- \(M\)-convex functions and tree metrics
Cited in
(18)- scientific article; zbMATH DE number 6921290 (Why is no real title available?)
- Integrality of subgradients and biconjugates of integrally convex functions
- Continuous relaxation for discrete DC programming
- Parametric monotone function maximization with matroid constraints
- Continuous relaxation for discrete DC programming
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
- The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions
- Novel algorithms for maximum DS decomposition
- Set function optimization
- A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques
- Recent progress on integrally convex functions
- DC Programming Approaches for BMI and QMI Feasibility Problems
- A revision of the rectangular algorithm for a class of DC optimization problems
- MAP inference algorithms without approximation for collective graphical models on path graphs via discrete difference of convex algorithm
- Maximize a monotone function with a generic submodularity ratio
- Fast algorithms for maximizing monotone nonsubmodular functions
- Fast algorithms for maximizing monotone nonsubmodular functions
- Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices
This page was built for publication: A framework of discrete DC programming by discrete convex analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494333)
