Global optimization of bilinear programs with a multiparametric disaggregation technique
From MaRDI portal
Publication:386453
DOI10.1007/s10898-012-0022-1zbMath1282.90137OpenAlexW2037054598MaRDI QIDQ386453
Pedro M. Castro, Scott Kolodziej, Ignacio E. Grossmann
Publication date: 9 December 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-0022-1
global optimizationquadratic optimizationdisjunctive programmingmixed integer linear programmingmixed integer nonlinear programming
Related Items
Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems, Multiobjective optimization for aircraft conflict resolution. A metaheuristic approach, Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, On preparedness resource allocation planning for natural disaster relief under endogenous uncertainty with time-consistent risk-averse management, The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems, Tightening methods based on nontrivial bounds on bilinear terms, Optimization under Decision-Dependent Uncertainty, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, Global optimization of MIQCPs with dynamic piecewise relaxations, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization, Some matheuristic algorithms for multistage stochastic optimization models with endogenous uncertainty and risk management, The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints, Variable Bound Tightening and Valid Constraints for Multiperiod Blending, Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming, Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms, Approximating maxmin strategies in imperfect recall games using A-loss recall property, Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique, 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, New multi-commodity flow formulations for the pooling problem, QPLIB: a library of quadratic programming instances, Optimal influenza vaccine distribution with equity, Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic, Convexification of bilinear forms through non-symmetric lifting, Joint location and pricing within a user-optimized environment, Output feedback design for discrete-time constrained systems subject to persistent disturbances via bilinear programming, Solving certain complementarity problems in power markets via convex programming, Global optimality bounds for the placement of control valves in water supply networks, An adaptive discretization algorithm for the design of water usage and treatment networks, Discretization and global optimization for mixed integer bilinear programming, Univariate parameterization for global optimization of mixed-integer polynomial problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- GLOMIQO: global mixed-integer quadratic optimizer
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Test examples for nonlinear programming codes
- Dual quadratic estimates in polynomial and Boolean programming
- A new reformulation-linearization technique for bilinear programming problems
- Comparison of generalized geometric programming algorithms
- An iterative approach to quadratic optimization
- Global optimization of signomial geometric programming using linear relaxation.
- Approximating quadratic programming with bound and quadratic constraints
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Review of nonlinear mixed-integer and disjunctive programming techniques
- A global optimization algorithm for linear fractional and bilinear programs
- BARON: A general purpose global optimization software package
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Jointly Constrained Biconvex Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- CONOPT—A Large-Scale GRG Code
- Semidefinite relaxation and nonconvex quadratic optimization
