scientific article; zbMATH DE number 1054663

MaRDI QIDQ4352203zbMATH OpenFDO

Authors Thomas G. W. Epperly, Ross E. Swaney

Publication date 28 August 1997

zbMATH Keywords

branch and boundglobal solutionnonconvex nonlinear programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 1054662
• A branch and bound algorithm for globally solving a class of nonconvex programming problems
• A branch and bound algorithm for a class of non-convex programming problems
• A reduced space branch and bound algorithm for global optimization.

Cited in

(13)

• Some branch and bound techniques for nonlinear optimization
• A reduced space branch and bound algorithm for global optimization.
• Guided dive for the spatial branch-and-bound
• Domain reduction techniques for global NLP and MINLP optimization
• Improve-and-branch algorithm for the global optimization of nonconvex NLP problems
• A branch and bound algorithm for globally solving a class of nonconvex programming problems
• scientific article; zbMATH DE number 1054662 (Why is no real title available?)
• scientific article; zbMATH DE number 1054665 (Why is no real title available?)
• 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
• Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
• Algorithm for solving NLP problems with the use of a modified Lagrange function

Describes a project that uses

Uses Software

• MINOS

This page was built for publication:

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