Approximate branch-and-bound global optimization using B-spline hypervolumes-Reference-Cited by-同舟云学术

Approximate branch-and-bound global optimization using B-spline hypervolumes

Published:2012-03 Issue:1 Volume:45 Page:11-20
ISSN:0965-9978
Container-title:Advances in Engineering Software
language:en
Short-container-title:Advances in Engineering Software

Author:

Park Sangkun

Publisher

Elsevier BV

Subject

General Engineering,Software

Reference21 articles.

1. Parallel continuous simulated annealing for global optimization;Hamma;Optimiz Methods Softw,2000

2. Genetic algorithms: principles of natural selection applied to computation;Forrest;Science,1993

3. Complete search in continuous global optimization and constraint satisfaction in Acta Numerica;Neumaier,2004

4. Floudas CA. Overview of αBB-based approaches in deterministic global optimization. Workshop on Global Optimization. Imperial College London; December 2007. p. 15–7.

5. On finitely terminating branch-and-bound algorithms for some global optimization problems;Al-Khayyal;SIAM J Optimiz,2000

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Constrained global optimization of multivariate polynomials using polynomial B-spline form and B-spline consistency prune approach;RAIRO - Operations Research;2021-11

2. Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: The single and multi-segment polynomial B-spline approach;Computers & Operations Research;2017-11

3. Global optimization with spline constraints: a new branch-and-bound method based on B-splines;Journal of Global Optimization;2015-09-03

4. Solving Nonconvex Optimization Problems in Systems and Control: A Polynomial B-spline Approach;Advances in Intelligent Systems and Computing;2015