Continuous relaxation for discrete DC programming
From MaRDI portal
Publication:1749451
DOI10.1007/S10107-017-1139-2zbMATH Open1397.90330OpenAlexW811824032MaRDI QIDQ1749451FDOQ1749451
Authors: Takanori Maehara, Naoki Marumo, Kazuo Murota 
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
Recommendations
- Continuous relaxation for discrete DC programming
- Discrete L-convex function minimization based on continuous relaxation
- A framework of discrete DC programming by discrete convex analysis
- scientific article; zbMATH DE number 1552036
- A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques
Cites Work
- The Concave-Convex Procedure
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming: overview.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Discrete Convex Analysis
- Compressed sensing
- Optimization with sparsity-inducing penalties
- Submodular functions and optimization.
- Discrete tomography by convex--concave regularization and D.C. programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recent developments in discrete convex analysis
- A continuous approch for globally solving linearly constrained quadratic
- Continuous approaches for solving discrete optimization problems
- A DC Programming Approach for Mixed-Integer Linear Programs
- Title not available (Why is that?)
- A framework of discrete DC programming by discrete convex analysis
- Decomposition approach for the global minimization of biconcave functions over polytopes
- Bisubmodular polyhedra, simplicial divisions, and discrete convexity
- M-convex function minimization by continuous relaxation approach: proximity theorem and algorithm
- The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions
- Discrete L-convex function minimization based on continuous relaxation
Cited In (6)
- Continuous relaxation for discrete DC programming
- Title not available (Why is that?)
- Discrete L-convex function minimization based on continuous relaxation
- A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques
- 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
This page was built for publication: Continuous relaxation for discrete DC programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749451)
