Branch and probability bound methods in multi-objective optimization

DOI10.1007/S11590-014-0777-ZMaRDI QIDQ5963235zbMATH OpenOpenAlexFDO

Authors Antanas Žilinskas, A. Zhigljavsky

Publication date 4 March 2016

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-014-0777-z

zbMATH Keywords

branch-and-bound approachglobal optimizationmulti-objective optimizationstatistics of extremal values

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Multi-objective branch and bound
• Non-convex multi-objective optimization
• A general branch-and-bound framework for continuous global multiobjective optimization
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• scientific article; zbMATH DE number 1199856

Cites work

• A one-step worst-case optimal algorithm for bi-objective univariate optimization
• A statistical model-based algorithm for `black-box' multi-objective optimisation
• Deterministic global optimization. Geometric branch-and-bound methods and their applications
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Handbook of multicriteria analysis
• scientific article; zbMATH DE number 50672 (Why is no real title available?)
• scientific article; zbMATH DE number 1199856 (Why is no real title available?)
• scientific article; zbMATH DE number 5487989 (Why is no real title available?)
• Introduction to global optimization exploiting space-filling curves
• Introduction to global optimization.
• Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
• Nonlinear multiobjective optimization
• Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
• Numerical computations and mathematical modelling with infinite and infinitesimal numbers
• On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
• Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
• Stochastic global optimization.

Cited in

(12)

• Performance of global random search algorithms for large dimensions
• A general branch-and-bound framework for continuous global multiobjective optimization
• Integrating -dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems
• Generalized target-allocation functions and their evaluation by the branch-and-bound method
• Branch-and-bound and objective branching with three or more objectives
• scientific article; zbMATH DE number 3889299 (Why is no real title available?)
• scientific article; zbMATH DE number 1199856 (Why is no real title available?)
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• Modified Tseng's extragradient methods for solving pseudo-monotone variational inequalities
• Preface to the special issue ``Recent developments in non-linear and global optimization
• Limit sets in global multiobjective optimization
• Reference-point-based branch and bound algorithm for multiobjective optimization

This page was built for publication: Branch and probability bound methods in multi-objective optimization

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