scientific article; zbMATH DE number 2068028

MaRDI QIDQ4464626zbMATH OpenFDO

Authors Gleb Beliakov, Kai Ming Ting, A. M. Rubinov

Publication date 27 May 2004

zbMATH Keywords

cutting angle methodglobal optimizationparallel computing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Nonlinear programming (90C30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Fast algorithm for the cutting angle method of global optimization
• Cutting angle methods in global optimization
• Modified versions of the cutting angle method.
• Cutting angle method and a local search
• An approach to the subproblem of the cutting angle method of global optimization

Cited in

(4)

• Fast algorithm for the cutting angle method of global optimization
• Solving DC programs using the cutting angle method
• Challenges of continuous global optimization in molecular structure prediction
• Bounded lower subdifferentiability optimization techniques: applications

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