New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
From MaRDI portal
Publication:1371947
DOI10.1016/S0167-6377(97)00013-8zbMath0885.90105MaRDI QIDQ1371947
Hanif D. Sherali, Cihan H. Tuncbilek
Publication date: 6 November 1997
Published in: Operations Research Letters (Search for Journal in Brave)
global optimizationnonconvex programmingengineering designpolynomial programmingreformulation-linearization techniquelocation allocation
Related Items
Solution to nonconvex quadratic programming with both inequality and box constraints, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems, Large-scale standard pooling problems with constrained pools and fixed demands, Global optimality conditions and optimization methods for constrained polynomial programming problems, GLOMIQO: global mixed-integer quadratic optimizer, DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality, A framework for globally optimizing mixed-integer signomial programs, Computation of polytopic invariants for polynomial dynamical systems using linear programming, Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs, Efficient separation of RLT cuts for implicit and explicit bilinear products, Reduced RLT representations for nonconvex polynomial programming problems, Nonlinear robust optimization via sequential convex bilevel programming, Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts, Global minimization using an augmented Lagrangian method with variable lower-level constraints, Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs, LP Formulations for Polynomial Optimization Problems, A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems, Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Global optimization of general nonconvex problems with intermediate polynomial substructures, Global optimization for sum of generalized fractional functions, RLT: A unified approach for discrete and continuous nonconvex optimization, Global optimization of general non-convex problems with intermediate bilinear substructures, Canonical dual least square method for solving general nonlinear systems of quadratic equations, Solutions to quadratic minimization problems with box and integer constraints, Reformulations in Mathematical Programming: Definitions and Systematics, Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, Computation of parameter stability margins using polynomial programming techniques, Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality, Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares, Univariate parameterization for global optimization of mixed-integer polynomial problems
Cites Work
- Unnamed Item
- Dual quadratic estimates in polynomial and Boolean programming
- Unconstrained and constrained global optimization of polynomial functions in one variable
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Globally minimizing polynomials without evaluating derivatives
