A disjunctive cut strengthening technique for convex MINLP
From MaRDI portal
Publication:2129197
DOI10.1007/S11081-020-09551-6zbMATH Open1484.90049OpenAlexW3080467265MaRDI QIDQ2129197FDOQ2129197
Publication date: 22 April 2022
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-020-09551-6
Recommendations
- Disjunctive Cuts for Nonconvex MINLP
- Lift-and-project cuts for mixed integer convex programs
- Cutting plane algorithm for convex generalized disjunctive programs
- Lift-and-project cuts for convex mixed integer nonlinear programs
- An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- Juniper: an open-source nonlinear branch-and-bound solver in Julia
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- A storm of feasibility pumps for nonconvex MINLP
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Generalized Benders decomposition
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Heuristics for convex mixed integer nonlinear programs
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Different transformations for solving non-convex trim-loss problems by MINLP
- Computational study of a family of mixed-integer quadratic programming problems
- Disjunctive Programming
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Title not available (Why is that?)
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Conic mixed-integer rounding cuts
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Generalized intersection cuts and a new cut generating paradigm
- The Supporting Hyperplane Method for Unimodal Programming
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Lift-and-Project Cuts for Mixed Integer Convex Programs
- Reformulations for utilizing separability when solving convex MINLP problems
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- Reformulating the disjunctive cut generating linear program
- Cutting Plane Algorithm for Convex Generalized Disjunctive Programs
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
- Using regularization and second order information in outer approximation for convex MINLP
- Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
- A fast heuristic for minimising total average cycle stock subject to practical constraints
Cited In (9)
- Title not available (Why is that?)
- A convex-analysis perspective on disjunctive cuts
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
- Disjunctive Cuts for Nonconvex MINLP
- Announcement: Howard Rosenbrock Prize 2022
- Disjunctive cuts in mixed-integer conic optimization
- Announcement: Howard Rosenbrock prize 2021
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
Uses Software
This page was built for publication: A disjunctive cut strengthening technique for convex MINLP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129197)
