Reduction constraints for the global optimization of NLPs

DOI10.1111/J.1475-3995.2004.00438.XMaRDI QIDQ4654430zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A reduced space branch and bound algorithm for global optimization.
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
• Bound reduction using pairs of linear inequalities
• scientific article; zbMATH DE number 1054662
• Convex and concave relaxations of implicit functions

Cites work

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

Cited in

(20)

• Reformulation in mathematical programming: An application to quantum chemistry
• A reduced space branch and bound algorithm for global optimization.
• Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
• Domain reduction techniques for global NLP and MINLP optimization
• Time-optimal velocity planning by a bound-tightening technique
• A branch-and-reduce approach to global optimization
• Global minimization using an augmented Lagrangian method with variable lower-level constraints
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
• Bound reduction using pairs of linear inequalities
• Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
• Linearity embedded in nonconvex programs
• Comparison of deterministic and stochastic approaches to global optimization
• Reformulations in Mathematical Programming: Definitions and Systematics
• GLOMIQO: global mixed-integer quadratic optimizer
• scientific article; zbMATH DE number 1078157 (Why is no real title available?)
• On the Performance of NLP Solvers Within Global MINLP Solvers
• A Sequential Linear Constraint Programming Algorithm for NLP
• Efficient separation of RLT cuts for implicit and explicit bilinear products
• Efficient separation of RLT cuts for implicit and explicit bilinear terms
• Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming

This page was built for publication: Reduction constraints for the global optimization of NLPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4654430)