Pages that link to "Item:Q5930738"

The following pages link to Global optimization of nonconvex factorable programming problems (Q5930738):

Displaying 16 items.

• Extended reverse-convex programming: an approximate enumeration approach to global optimization (Q288222) (← links)
• 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)
• Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
• Modeling probability densities with sums of exponentials via polynomial approximation (Q495127) (← links)
• RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
• Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688) (← links)
• Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
• A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
• A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
• On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
• Global optimization of nonconvex problems with convex-transformable intermediates (Q1756773) (← links)
• Reduction constraints for the global optimization of NLPs (Q4654430) (← links)
• Optimization conditions and decomposable algorithms for convertible nonconvex optimization (Q5058177) (← links)