Pages that link to "Item:Q1187374"
From MaRDI portal
The following pages link to A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374):
Displaying 50 items.
- Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares (Q258393) (← links)
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- A parameter optimization heuristic for a temperature estimation model (Q374613) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Computing the lowest equilibrium pose of a cable-suspended rigid body (Q402228) (← links)
- Rank of Handelman hierarchy for Max-Cut (Q408389) (← links)
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- On the solution of the inverse eigenvalue complementarity problem (Q467406) (← links)
- Extended formulations for convex envelopes (Q486393) (← links)
- Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- Sequential decision making with partially ordered preferences (Q646545) (← links)
- Using mathematical programming to solve factored Markov decision processes with imprecise probabilities (Q648368) (← links)
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688) (← links)
- Canonical dual least square method for solving general nonlinear systems of quadratic equations (Q711390) (← links)
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
- On an enumerative algorithm for solving eigenvalue complementarity problems (Q742298) (← links)
- A global optimization RLT-based approach for solving the fuzzy clustering problem (Q816063) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- On generalized geometric programming problems with non-positive variables (Q857357) (← links)
- Computational method for the profit bounds of inventory model with interval demand and unit cost (Q864804) (← links)
- An inverse reliability-based approach for designing under uncertainty with application to robust piston design (Q868632) (← links)
- A global optimization algorithm using parametric linearization relaxation (Q876659) (← links)
- Exact \(L_{2}\)-norm plane separation (Q941041) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- Fuzzy profit measures for a fuzzy economic order quantity model (Q949990) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- Solutions to quadratic minimization problems with box and integer constraints (Q989896) (← links)
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (Q1016064) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- An effective linear approximation method for separable programming problems (Q1036545) (← links)
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality (Q1037375) (← links)
- Exact and heuristic solutions of the global supply chain problem with transfer pricing (Q1041020) (← links)
- On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
- A new reformulation-linearization technique for bilinear programming problems (Q1201905) (← links)
- An approximate approach of global optimization for polynomial programming problems (Q1296128) (← links)
- Primal-relaxed dual global optimization approach (Q1321372) (← links)
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799) (← links)
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems (Q1371947) (← links)
- Global optimization of signomial geometric programming using linear relaxation. (Q1428180) (← links)
- An efficient linearization approach for mixed-integer problems (Q1572989) (← links)
- A linearization method for mixed 0--1 polynomial programs (Q1577382) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- Extra resource allocation: a DEA approach in the view of efficiencies (Q1655921) (← links)
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
