A framework of discrete DC programming by discrete convex analysis (Q494333): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-014-0792-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080412728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On difference convexity of locally Lipschitz functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Monotone Submodular Function Subject to a Matroid Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Non-monotone Submodular Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated Matroid Intersection I: Optimality Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON DISCRETE HESSIAN MATRIX AND CONVEX EXTENSIBILITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized polymatroids and submodular flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on L-/M-convex functions and the separation theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On functions representable as a difference of convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(M\)-convex functions and tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC programming: overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for convex cost tension problem with application to computer vision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-monotone submodular maximization under matroid and knapsack constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular containment is hard, even for networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete convex analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated Matroid Intersection II: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid valuation on independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices and matroids for systems analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Developments in Discrete Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: M-Convex Function on Generalized Polymatroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dijkstra's algorithm and L-concave function maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing a Submodular Function on a Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear discrete optimization. An algorithmic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster strongly polynomial time algorithm for submodular function minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fenchel-Rockafellar type duality theorem for maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A duality principle for non-convex optimisation and the calculus of variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of a difference of two convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Concave-Convex Procedure / rank
 
Normal rank

Latest revision as of 17:37, 10 July 2024

scientific article
Language Label Description Also known as
English
A framework of discrete DC programming by discrete convex analysis
scientific article

    Statements

    A framework of discrete DC programming by discrete convex analysis (English)
    0 references
    0 references
    0 references
    31 August 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers