Pages that link to "Item:Q427362"
From MaRDI portal
The following pages link to Reduced RLT representations for nonconvex polynomial programming problems (Q427362):
Displaying 16 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Extended formulations for convex envelopes (Q486393) (← links)
- Enhancing RLT relaxations via a new class of semidefinite cuts (Q598599) (← links)
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations (Q1785386) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- Template polyhedra and bilinear optimization (Q2322312) (← links)
- Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver (Q2689854) (← links)
- LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)
