Nonconvex constrained optimization by a filtering branch and bound
type: Item
instance of: scholarly article
title: Nonconvex constrained optimization by a filtering branch and bound
zbMATH Open document ID: 1470.90088
author: Gabriele Eichfelder
author: Kathrin Klamroth
author: Julia Niebling
published in: Journal of Global Optimization
publication date: 2021-07-07T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7369386
zbMATH Keywords: constrained optimization
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: global optimization
zbMATH Keywords: branch and bound
zbMATH Keywords: multiobjective optimization
describes a project that uses: INTLAB
describes a project that uses: MINOS
describes a project that uses: GAMS
describes a project that uses: MODIR
MaRDI profile type: Publication
full work available at URL: s10898-020-00956-2
OpenAlex ID: W3092658954
cites work: A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
cites work: Multicriteria Optimization
cites work: An approximation algorithm for convex multi-objective programming problems
cites work: A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
cites work: A deterministic algorithm for global multi-objective optimization
cites work: Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
cites work: Nonlinear programming without a penalty function.
cites work: Relationships between constrained and unconstrained multi-objective optimization and application in location theory
cites work: Q5652460
cites work: Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
cites work: Constrained optimization using multiple objective programming
cites work: Primal and dual approximation algorithms for convex vector optimization problems
cites work: Global minimum potential energy conformations of small molecules
cites work: Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
cites work: Non-convex multi-objective optimization
cites work: Q4949347
cites work: Theory of multiobjective optimization
cites work: The multicriteria big cube small cube method
cites work: Deterministic global optimization. Geometric branch-and-bound methods and their applications
cites work: Bi-dimensional knapsack problems with one soft constraint
cites work: Improved Automatic Computation of Hessian Matrix Spectral Bounds
cites work: Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: Bi-objective decision making in global optimization based on statistical models
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-00956-2
description: scientific article; zbMATH DE number 7369386