Pages that link to "Item:Q2583177"
From MaRDI portal
The following pages link to Linearity embedded in nonconvex programs (Q2583177):
Displaying 11 items.
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks (Q628648) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Reformulation in mathematical programming: An application to quantum chemistry (Q1025997) (← links)
- Convexification of bilinear forms through non-symmetric lifting (Q2045010) (← links)
- Tightening methods based on nontrivial bounds on bilinear terms (Q2168621) (← links)
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem (Q2459384) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- Global optimization of general non-convex problems with intermediate bilinear substructures (Q5746708) (← links)