Convex relaxations for mixed-integer nonlinear programs
From MaRDI portal
Recommendations
- Mixed integer programming with a class of nonlinear convex constraints
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- An algorithmic framework for convex mixed integer nonlinear programs
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Convex relaxation for solving posynomial programs
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Heuristics for convex mixed integer nonlinear programs
Cited in
(27)- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- A relaxation algorithm for solving mixed integer programming problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Some results on the strength of relaxations of multilinear functions
- Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks
- A new framework to relax composite functions in nonlinear programs
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Tight convex relaxations for the expansion planning problem
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming
- scientific article; zbMATH DE number 3900505 (Why is no real title available?)
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Feasibility in reverse convex mixed-integer programming
- scientific article; zbMATH DE number 2102019 (Why is no real title available?)
- On generalized surrogate duality in mixed-integer nonlinear programming
- Improved regularity assumptions for partial outer convexification of mixed-integer PDE-constrained optimization problems
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Optimization of wear related material costs of a hydrostatic transmission system via MINLP
- Tighter relaxations in mixed-integer nonlinear programming
- Simultaneous convexification for the planar obnoxious facility location problem
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Chvátal closures for mixed integer programming problems
Describes a project that uses
Uses Software
This page was built for publication: Convex relaxations for mixed-integer nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4605948)
