RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017): Difference between revisions

@@ Property / DOI @@
-.1007/s12532-016-0099-5
@@ Property / DOI: 10.1007/s12532-016-0099-5 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+BARON
@@ Property / describes a project that uses: BARON / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+alphaBB
@@ Property / describes a project that uses: alphaBB / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SNOPT
@@ Property / describes a project that uses: SNOPT / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SparsePOP
@@ Property / describes a project that uses: SparsePOP / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Matlab
@@ Property / describes a project that uses: Matlab / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SeDuMi
@@ Property / describes a project that uses: SeDuMi / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CPLEX
@@ Property / describes a project that uses: CPLEX / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Couenne
@@ Property / describes a project that uses: Couenne / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s12532-016-0099-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2415917885
@@ Property / OpenAlex ID: W2415917885 / rank @@
+Normal rank
@@ Property / cites work @@
+\(\alpha BB\): A global optimization method for general constrained nonconvex problems
+Normal rank
@@ Property / cites work @@
+Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
+Normal rank
@@ Property / cites work @@
+On convex relaxations for quadratically constrained quadratic programming
+Normal rank
@@ Property / cites work @@
+Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
+Normal rank
@@ Property / cites work @@
+Nonlinear Programming
@@ Property / cites work: Nonlinear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Branching and bounds tighteningtechniques for non-convex MINLP
+Normal rank
@@ Property / cites work @@
+Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
+Normal rank
@@ Property / cites work @@
+SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
+Normal rank
@@ Property / cites work @@
+Test examples for nonlinear programming codes
@@ Property / cites work: Test examples for nonlinear programming codes / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite Programming vs. LP Relaxations for Polynomial Programming
+Normal rank
@@ Property / cites work @@
+Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
+Normal rank
@@ Property / cites work @@
+Q5292090
@@ Property / cites work: Q5292090 / rank @@
+Normal rank
@@ Property / cites work @@
+Linearity embedded in nonconvex programs
@@ Property / cites work: Linearity embedded in nonconvex programs / rank @@
+Normal rank
@@ Property / cites work @@
+An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
+Normal rank
@@ Property / cites work @@
+A branch-and-reduce approach to global optimization
+Normal rank
@@ Property / cites work @@
+A reformulation-linearization technique for solving discrete and continuous nonconvex problems
+Normal rank
@@ Property / cites work @@
+A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
+Normal rank
@@ Property / cites work @@
+Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
+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 @@
+Reduced RLT representations for nonconvex polynomial programming problems
+Normal rank
@@ Property / cites work @@
+Enhancing RLT relaxations via a new class of 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 @@
+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 @@
+Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
+Normal rank
@@ Property / cites work @@
+A polyhedral branch-and-cut approach to global optimization
+Normal rank
@@ Property / cites work @@
+Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
+Normal rank
@@ Property / cites work @@
+Global optimization of general nonconvex problems with intermediate polynomial substructures
+Normal rank
@@ Property / DOI @@
+.1007/S12532-016-0099-5
@@ Property / DOI: 10.1007/S12532-016-0099-5 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:340017