Continuous relaxation for discrete DC programming

DOI10.1007/s10107-017-1139-2zbMath1397.90330OpenAlexW811824032MaRDI QIDQ1749451

Naoki Marumo, Kazuo Murota, Takanori Maehara

Publication date: 16 May 2018

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-017-1139-2

zbMATH Keywords

continuous relaxationlin-vex extension

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

MAP inference algorithms without approximation for collective graphical models on path graphs via discrete difference of convex algorithm, Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices, A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques

Cites Work

• A framework of discrete DC programming by discrete convex analysis
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions
• Decomposition approach for the global minimization of biconcave functions over polytopes
• DC programming: overview.
• Bisubmodular polyhedra, simplicial divisions, and discrete convexity
• Submodular functions and optimization.
• Discrete tomography by convex--concave regularization and D.C. programming
• A continuous approch for globally solving linearly constrained quadratic
• Optimization with Sparsity-Inducing Penalties
• Recent Developments in Discrete Convex Analysis
• M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm
• A DC Programming Approach for Mixed-Integer Linear Programs
• The Concave-Convex Procedure
• Discrete Convex Analysis
• Compressed sensing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item