A general branch-and-bound framework for continuous global multiobjective optimization
type: Item
instance of: scholarly article
title: A general branch-and-bound framework for continuous global multiobjective optimization
zbMATH Open document ID: 1470.90114
author: Gabriele Eichfelder
author: Peter Kirst
author: Laura Meng
author: Oliver Stein
published in: Journal of Global Optimization
publication date: 2021-07-07T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7369393
zbMATH Keywords: multiobjective optimization
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: global optimization
zbMATH Keywords: branch-and-bound algorithm
zbMATH Keywords: enclosure
describes a project that uses: INTLAB
MaRDI profile type: Publication
full work available at URL: s10898-020-00984-y
OpenAlex ID: W3124460525
cites work: Jointly Constrained Biconvex Programming
cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems
cites work: Disjunctive Cuts for Nonconvex MINLP
cites work: Vector optimization. Set-valued and variational analysis.
cites work: Efficient computation of the search region in multi-objective optimization
cites work: Multi-objective optimization using evolutionary algorithms
cites work: Multicriteria Optimization
cites work: Method of non-uniform coverages to solve the multicriteria optimization problems with guaranteed accuracy
cites work: Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
cites work: Convergent upper bounds in global minimization with nonlinear equality constraints
cites work: Nonconvex separation theorems and some applications in vector optimization
cites work: Variational methods in partially ordered spaces
cites work: New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
cites work: Q4445267
cites work: Q3437868
cites work: Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
cites work: On the representation of the search region in multi-objective optimization
cites work: \(\epsilon\)-solutions in vector minimization problems
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
cites work: Interval Methods for Systems of Equations
cites work: Non-convex multi-objective optimization
cites work: Q4949347
cites work: Approximation methods in multiobjective programming
cites work: The multicriteria big cube small cube method
cites work: Theory of multiobjective optimization
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: On the worst-case optimal multi-objective global optimization
cites work: Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
DOI: 10.1007/S10898-020-00984-Y
description: scientific article; zbMATH DE number 7369393