Reduction constraints for the global optimization of NLPs

DOI10.1111/j.1475-3995.2004.00438.xzbMath1057.90043OpenAlexW2054232136MaRDI QIDQ4654430

Leo Liberti

Publication date: 4 March 2005

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2004.00438.x

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items

GLOMIQO: global mixed-integer quadratic optimizer, Convex quadratic relaxations for mixed-integer nonlinear programs in power systems, Efficient separation of RLT cuts for implicit and explicit bilinear products, Global minimization using an augmented Lagrangian method with variable lower-level constraints, Comparison of deterministic and stochastic approaches to global optimization, Reformulations in Mathematical Programming: Definitions and Systematics, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, Reformulation in mathematical programming: An application to quantum chemistry, Linearity embedded in nonconvex programs

Cites Work

• A new reformulation-linearization technique for bilinear programming problems
• Recent developments and trends in global optimization
• Computing global minima to polynomial optimization problems using Gröbner bases
• Jointly Constrained Biconvex Programming
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Global optimization of nonconvex factorable programming problems