A graphical framework for global optimization of mixed-integer nonlinear programs
From MaRDI portal
Cites work
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
- A branch-and-reduce approach to global optimization
- A finite algorithm for global minimization of separable concave programs
- A locally-biased form of the DIRECT algorithm.
- A polyhedral branch-and-cut approach to global optimization
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- Achieving consistency with cutting planes
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- An information theoretic approach to econometrics
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Analysis of bounds for multilinear functions
- BARON: A general purpose global optimization software package
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convex extensions and envelopes of lower semi-continuous functions
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Convexification of bilinear terms over network polytopes
- Decision diagram-based branch-and-bound with caching for dominance and suboptimality detection
- Decision diagrams for optimization
- Deterministic global optimization with artificial neural networks embedded
- Discrete optimization with decision diagrams
- Domain reduction techniques for global NLP and MINLP optimization
- Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of nonconvex problems with multilinear intermediates
- scientific article; zbMATH DE number 1082203 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
- Lagrangian bounds from decision diagrams
- Mathematical programming formulations for the alternating current optimal power flow problem
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Mixed-integer nonlinear optimization
- On branching rules for convex mixed-integer nonlinear optimization
- On decomposability of multilinear sets
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the Structure of Decision Diagram–Representable Mixed-Integer Programs with Application to Unit Commitment
- Outer approximation for integer nonlinear programs via decision diagrams
- Relaxations of factorable functions with convex-transformable intermediates
- SCIP: solving constraint integer programs
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Solving mixed integer bilinear problems using MILP formulations
- Some results on the strength of relaxations of multilinear functions
- Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
- Strong relaxations for continuous nonlinear programs based on decision diagrams
- Target cuts from relaxed decision diagrams
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- The supporting hyperplane optimization toolkit for convex MINLP
This page was built for publication: A graphical framework for global optimization of mixed-integer nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7389575)