A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques
From MaRDI portal
Publication:5151528
DOI10.1080/02331934.2019.1698037zbMath1460.90115arXiv1702.00553OpenAlexW2992180065MaRDI QIDQ5151528
Takayuki Okuno, Yoshiko T. Ikebe
Publication date: 19 February 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.00553
Uses Software
Cites Work
- A framework of discrete DC programming by discrete convex analysis
- Smoothing methods for nonsmooth, nonconvex minimization
- SCIP: solving constraint integer programs
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA
- Solving mixed integer nonlinear programs by outer approximation
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Continuous relaxation for discrete DC programming
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- DC programming: overview.
- A trust region SQP algorithm for mixed-integer nonlinear programming
- Generalized Benders decomposition
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- A DC Programming Approach for Mixed-Integer Linear Programs
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Introduction to global optimization.
- Global optimization of nonconvex factorable programming problems
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
