Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10898-010-9639-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2034063035
@@ Property / OpenAlex ID: W2034063035 / rank @@
+Normal rank
@@ Property / cites work @@
+SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
+Normal rank
@@ Property / cites work @@
+Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
+Normal rank
@@ Property / cites work @@
+Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
+Normal rank
@@ Property / cites work @@
+Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
+Normal rank
@@ Property / cites work @@
+A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
+Normal rank
@@ Property / cites work @@
+Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
+Normal rank
@@ Property / cites work @@
+New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
+Normal rank
@@ Property / cites work @@
+Global optimization of nonconvex factorable programming problems
+Normal rank
@@ Property / cites work @@
+Dual quadratic estimates in polynomial and Boolean programming
+Normal rank
@@ Property / cites work @@
+Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
+Normal rank
@@ Property / cites work @@
+A polyhedral branch-and-cut approach to global optimization
+Normal rank