Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
From MaRDI portal
Publication:280099
DOI10.1007/S10898-015-0342-ZzbMATH Open1346.90625OpenAlexW986230988MaRDI QIDQ280099FDOQ280099
Authors: Pedro M. Castro 
Publication date: 29 April 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0342-z
Recommendations
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
algorithmquadratic optimizationmixed integer nonlinear programmingdisjunctive programmingprocess networks
Cites Work
- BARON: A general purpose global optimization software package
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- GLOMIQO: global mixed-integer quadratic optimizer
- CONOPT—A Large-Scale GRG Code
- Benchmarking optimization software with performance profiles.
- A polyhedral branch-and-cut approach to global optimization
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Test examples for nonlinear programming codes
- A new reformulation-linearization technique for bilinear programming problems
- Different transformations for solving non-convex trim-loss problems by MINLP
- Handbook of test problems in local and global optimization
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Modelling with integer variables
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Disjunctive Programming
Cited In (13)
- Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique
- Sequence of polyhedral relaxations for nonlinear univariate functions
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
- The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems
- Global optimization of MIQCPs with dynamic piecewise relaxations
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Compact mixed-integer programming formulations in quadratic optimization
- Product disaggregation in global optimization and relaxations of rational programs
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
Uses Software
This page was built for publication: Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280099)
