scientific article; zbMATH DE number 6183018

MaRDI QIDQ5301189zbMATH OpenFDO

Authors Chandra Sekhar Pedamallu, Linet Özdamar, Tibor Csendes

Publication date 2 July 2013

zbMATH Keywords

continuous constrained optimizationinterval partitioning approachpractical applications

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Nonconvex programming, global optimization (90C26)

Recommendations

• Efficient interval partitioning for constrained global optimization
• Interval subdivision strategies for constrained optimization
• scientific article; zbMATH DE number 818540
• An interval algorithm for constrained global optimization
• scientific article; zbMATH DE number 4089334
• A cover partitioning method for bound constrained global optimization
• An interval branch and bound algorithm for bound constrained optimization problems
• A sequential approach for unconstrained optimization via a partitioning technique
• New interval methods for constrained global optimization
• scientific article; zbMATH DE number 1371597

Cited in

(5)

• Efficient interval partitioning-local search collaboration for constraint satisfaction
• Constraint partitioning for stability in path-constrained dynamic optimization problems
• Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization
• A sequential approach for unconstrained optimization via a partitioning technique
• Efficient interval partitioning for constrained global optimization

Describes a project that uses

Uses Software

• INTOPT_90
• CFSQP

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 Q5301189)