A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
From MaRDI portal
Publication:1187374
DOI10.1007/BF00121304zbMath0787.90088MaRDI QIDQ1187374
Cihan H. Tuncbilek, Hanif D. Sherali
Publication date: 13 August 1992
Published in: Journal of Global Optimization (Search for Journal in Brave)
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow, Efficient separation of RLT cuts for implicit and explicit bilinear products, (Global) optimization: historical notes and recent developments, Quantifying the benefits of customized vaccination strategies: A network‐based optimization approach, On the strength of recursive McCormick relaxations for binary polynomial optimization, A global supply chain model with transfer pricing and transportation cost allocation, A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems, The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal, Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems, A relaxation method for nonconvex quadratically constrained quadratic programs, A robust algorithm for quadratic optimization under quadratic constraints, The eigenvalue complementarity problem, On generalized geometric programming problems with non-positive variables, A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs, RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems, A reformulation-convexification approach for solving nonconvex quadratic programming problems, On linear programming relaxations for solving polynomial programming problems, Branch-reduction-bound algorithm for generalized geometric programming, Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications, Extra resource allocation: a DEA approach in the view of efficiencies, Computational method for the profit bounds of inventory model with interval demand and unit cost, A global optimization framework for distributed antenna location in CDMA cellular networks, Global optimization of non-convex piecewise linear regression splines, \(\alpha BB\): A global optimization method for general constrained nonconvex problems, An inverse reliability-based approach for designing under uncertainty with application to robust piston design, New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, A global optimization algorithm using parametric linearization relaxation, A parameter optimization heuristic for a temperature estimation model, A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables, Fractional 0-1 programming: applications and algorithms, A reformulation-linearization based algorithm for the smallest enclosing circle problem, DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips, Biconvex Models and Algorithms for Risk Management Problems, Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality, Computation of polytopic invariants for polynomial dynamical systems using linear programming, Computing the lowest equilibrium pose of a cable-suspended rigid body, Branch and cut algorithms for detecting critical nodes in undirected graphs, Rank of Handelman hierarchy for Max-Cut, A global optimization using linear relaxation for generalized geometric programming, A reformulation-linearization technique for optimization over simplices, Optimal egress time calculation and path generation for large evacuation networks, Canonical Duality-Triality Theory: Unified Understanding for Modeling, Problems, and NP-Hardness in Global Optimization of Multi-Scale Systems, Reduced RLT representations for nonconvex polynomial programming problems, A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem, Sequential decision making with partially ordered preferences, 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, Using mathematical programming to solve factored Markov decision processes with imprecise probabilities, Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs, A global optimization algorithm for signomial geometric programming problem, Global optimization of signomial geometric programming using linear relaxation., On the solution of the inverse eigenvalue complementarity problem, Inventory and investment in setup and quality operations under return on investment maximization, Extended formulations for convex envelopes, A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints, Extremal problems for convex polygons, Exact \(L_{2}\)-norm plane separation, Global optimality conditions and optimization methods for polynomial programming problems, A network approach for specially structured linear programs arising in 0-1 quadratic optimization, Fuzzy profit measures for a fuzzy economic order quantity model, Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities, Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Global optimization, An enhanced logarithmic method for signomial programming with discrete variables, Global optimization of general nonconvex problems with intermediate polynomial substructures, A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations, A new reformulation-linearization technique for bilinear programming problems, Global minimization of rational functions and the nearest GCDs, RLT: A unified approach for discrete and continuous nonconvex optimization, Linearization method of global optimization for generalized geometric programming, A new algorithm for concave quadratic programming, Second order cone programming relaxation of nonconvex quadratic optimization problems, Global optimization of general non-convex problems with intermediate bilinear substructures, Canonical dual least square method for solving general nonlinear systems of quadratic equations, A new two-level linear relaxed bound method for geometric programming problems, Optimal correction of the absolute value equations, Validating numerical semidefinite programming solvers for polynomial invariants, Solutions to quadratic minimization problems with box and integer constraints, DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs, Reformulations in Mathematical Programming: Definitions and Systematics, Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, On an enumerative algorithm for solving eigenvalue complementarity problems, The second-order cone eigenvalue complementarity problem, Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem, A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions, Computation of parameter stability margins using polynomial programming techniques, An effective linear approximation method for separable programming problems, Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality, An efficient linearization approach for mixed-integer problems, Exact and heuristic solutions of the global supply chain problem with transfer pricing, On optimal zero-preserving corrections for inconsistent linear systems, A linearization method for mixed 0--1 polynomial programs, An approximate approach of global optimization for polynomial programming problems, On the mixed integer signomial programming problems, On the posynomial fractional programming problems, A global optimization RLT-based approach for solving the hard clustering problem, Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D, Cutting planes for RLT relaxations of mixed 0-1 polynomial programs, Primal-relaxed dual global optimization approach, Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares, Univariate parameterization for global optimization of mixed-integer polynomial problems, A global optimization RLT-based approach for solving the fuzzy clustering problem, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
Cites Work
- Unnamed Item
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Constrained global optimization: algorithms and applications
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Nonlinear 0–1 programming: I. Linearization techniques
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Jointly Constrained Biconvex Programming
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
