An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
From MaRDI portal
Publication:2274851
DOI10.1007/s10898-018-00734-1zbMath1429.90056arXiv1707.02514OpenAlexW2963990227MaRDI QIDQ2274851
Russell Bent, Site Wang, Mowen Lu, Kaarthik Sundar, Harsha Nagarajan
Publication date: 1 October 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.02514
global optimizationMcCormickadaptive partitioningMILP-based methodsmixed integer nonlinear programspiecewise relaxationssequential optimization-based bound-tightening
Related Items
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT ⋮ On decomposition and multiobjective-based column and disjunctive cut generation for MINLP ⋮ Sequence of polyhedral relaxations for nonlinear univariate functions ⋮ The supporting hyperplane optimization toolkit for convex MINLP ⋮ Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design ⋮ Piecewise polyhedral formulations for a multilinear term ⋮ Robust Optimization with Continuous Decision-Dependent Uncertainty with applications to demand response management ⋮ A stochastic biomass blending problem in decentralized supply chains ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs ⋮ Real-time dispatch optimization for concentrating solar power with thermal energy storage ⋮ Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms ⋮ Improved convex and concave relaxations of composite bilinear forms ⋮ Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization ⋮ Compact mixed-integer programming formulations in quadratic optimization
Uses Software
Cites Work
- Unnamed Item
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- GLOMIQO: global mixed-integer quadratic optimizer
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- SCIP: solving constraint integer programs
- Test example for nonlinear programming codes
- Handbook of global optimization
- A convex envelope formula for multilinear functions
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Domain reduction techniques for global NLP and MINLP optimization
- A polyhedral branch-and-cut approach to global optimization
- BARON: A general purpose global optimization software package
- Some results on the strength of relaxations of multilinear functions
- On convex relaxations of quadrilinear terms
- Piecewise linear approximation of functions of two variables in MILP models
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Bound reduction using pairs of linear inequalities
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Strong SOCP Relaxations for the Optimal Power Flow Problem
- Feasibility-Based Bounds Tightening via Fixed Points
- Cutting Plane Algorithm for Convex Generalized Disjunctive Programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- JuMP: A Modeling Language for Mathematical Optimization
- Analysis of bounds for multilinear functions
