Linearity embedded in nonconvex programs

DOI10.1007/s10898-004-0864-2zbMath1124.90026OpenAlexW2091687474MaRDI QIDQ2583177

Leo Liberti

Publication date: 13 January 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-0864-2

zbMATH Keywords

RLTGlobal optimizationMINLPBilinearConvex relaxationReformulationReduction constraint

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items

A review of recent advances in global optimization, RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems, Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality, Efficient separation of RLT cuts for implicit and explicit bilinear products, Reduced RLT representations for nonconvex polynomial programming problems, A two-phase relaxation-based heuristic for the maximum feasible subsystem problem, Reformulations in Mathematical Programming: Definitions and Systematics, Reformulation in mathematical programming: An application to quantum chemistry

Uses Software

• SNOPT

Cites Work

• A new reformulation-linearization technique for bilinear programming problems
• A reduced space branch and bound algorithm for global optimization.
• Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
• Jointly Constrained Biconvex Programming
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Reduction constraints for the global optimization of NLPs