Reduction constraints for the global optimization of NLPs (Q4654430): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1111/j.1475-3995.2004.00438.x
+Normal rank
@@ Property / OpenAlex ID @@
+W2054232136
@@ Property / OpenAlex ID: W2054232136 / rank @@
+Normal rank
@@ Property / cites work @@
+Jointly Constrained Biconvex Programming
@@ Property / cites work: Jointly Constrained Biconvex Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Computing global minima to polynomial optimization problems using Gröbner bases
+Normal rank
@@ Property / cites work @@
+Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
+Normal rank
@@ Property / cites work @@
+Recent developments and trends in global optimization
+Normal rank
@@ Property / cites work @@
+A new reformulation-linearization technique for bilinear programming problems
+Normal rank
@@ Property / cites work @@
+Global optimization of nonconvex factorable programming problems
+Normal rank