A general branch-and-bound framework for continuous global multiobjective optimization

DOI10.1007/s10898-020-00984-yzbMath1470.90114OpenAlexW3124460525MaRDI QIDQ2038927

Peter Kirst, Laura Meng, Gabriele Eichfelder, Oliver Stein

Publication date: 7 July 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-020-00984-y

zbMATH Keywords

global optimizationbranch-and-bound algorithmnonconvex optimizationmultiobjective optimizationenclosure

Mathematics Subject Classification ID

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

Related Items (7)

An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs ⋮ Advancements in the computation of enclosures for multi-objective optimization problems ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ Limit sets in global multiobjective optimization ⋮ Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs ⋮ Reference-point-based branch and bound algorithm for multiobjective optimization

Uses Software

• INTLAB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the representation of the search region in multi-objective optimization
• On the worst-case optimal multi-objective global optimization
• Nonconvex separation theorems and some applications in vector optimization
• The multicriteria big cube small cube method
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
• Method of non-uniform coverages to solve the multicriteria optimization problems with guaranteed accuracy
• Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
• \(\epsilon\)-solutions in vector minimization problems
• Theory of multiobjective optimization
• Variational methods in partially ordered spaces
• Efficient computation of the search region in multi-objective optimization
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• Convergent upper bounds in global minimization with nonlinear equality constraints
• Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
• Non-convex multi-objective optimization
• Vector optimization. Set-valued and variational analysis.
• Approximation methods in multiobjective programming
• Disjunctive Cuts for Nonconvex MINLP
• New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
• Jointly Constrained Biconvex Programming
• Interval Methods for Systems of Equations
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• Multicriteria Optimization

This page was built for publication: A general branch-and-bound framework for continuous global multiobjective optimization