Branch and probability bound methods in multi-objective optimization

An approach to non-convex multi-objective optimization problems is considered where only the values of objective functions are required by the algorithm. The proposed approach is a generalization of the probabilistic branch-and-bound approach well applicable to complicated problems of single-objective global optimization. In the present paper the concept of probabilistic branch-and-bound based multi-objective optimization algorithms is discussed, and some illustrations are presented.

[1]  Deterministic Global Optimization , 2012 .

[2]  Remigijus Paulavi.  INVESTIGATION OF SELECTION STRATEGIES IN BRANCH AND BOUND ALGORITHM WITH SIMPLICIAL PARTITIONS AND COMBINATION OF LIPSCHITZ BOUNDS , 2009 .

[3]  Yaroslav D. Sergeyev,et al.  Numerical computations and mathematical modelling with infinite and infinitesimal numbers , 2012, ArXiv.

[4]  Daniel Scholz.  Deterministic Global Optimization: Geometric Branch-and-bound Methods and their Applications , 2011 .

[5]  Antanas Zilinskas,et al.  A one-step worst-case optimal algorithm for bi-objective univariate optimization , 2014, Optim. Lett..

[6]  Roman G. Strongin,et al.  Introduction to Global Optimization Exploiting Space-Filling Curves , 2013 .

[7]  Panos M. Pardalos,et al.  Introduction to Global Optimization , 2000, Introduction to Global Optimization.

[8]  Lonnie Hamm,et al.  GLOBAL OPTIMIZATION METHODS , 2002 .

[9]  Yaroslav D. Sergeyev,et al.  Lipschitz Global Optimization , 2011 .

[10]  Ignacy Kaliszewski,et al.  A theorem on nonconvex functions and its application to vector optimization , 1995 .

[11]  A. A. Zhigli︠a︡vskiĭ,et al.  Theory of Global Random Search , 1991 .

[12]  Panos M. Pardalos,et al.  Handbook of Multicriteria Analysis , 2010 .

[13]  Panos M. Pardalos,et al.  Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming , 2012, Optim. Lett..

[14]  A. A. Zhigli︠a︡vskiĭ,et al.  Stochastic Global Optimization , 2007 .

[15]  Y. D. Sergeyev,et al.  Global Optimization with Non-Convex Constraints - Sequential and Parallel Algorithms (Nonconvex Optimization and its Applications Volume 45) (Nonconvex Optimization and Its Applications) , 2000 .

[16]  Julius Zilinskas,et al.  Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds , 2010, Optim. Lett..

[17]  Anatoly Zhigljavsky,et al.  Branch and probability bound methods for global optimization , 1990 .

[18]  Mikhail Posypkin,et al.  Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy , 2013 .

[19]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[20]  Antanas Zilinskas,et al.  A statistical model-based algorithm for ‘black-box’ multi-objective optimisation , 2014, Int. J. Syst. Sci..

[21]  Antanas Zilinskas,et al.  On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions , 2011, Appl. Math. Comput..

[22]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[23]  A. Zhigljavsky.  Stochastic Global Optimization , 2008, International Encyclopedia of Statistical Science.