Pages that link to "Item:Q1654348"
From MaRDI portal
The following pages link to On linear programming relaxations for solving polynomial programming problems (Q1654348):
Displaying 12 items.
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- Border basis relaxation for polynomial optimization (Q898268) (← links)
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems (Q1361075) (← links)
- Sequence of polyhedral relaxations for nonlinear univariate functions (Q2147925) (← links)
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
- (Q3313633) (← links)
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs (Q3396382) (← links)
- (Q4365450) (← links)
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES (Q4446317) (← links)
- (Q4705029) (← links)
- Polynomial Programming: LP-Relaxations Also Converge (Q5317502) (← links)
- Efficient linear reformulations for binary polynomial optimization problems (Q6164618) (← links)