Nonconvex constrained optimization by a filtering branch and bound

DOI10.1007/s10898-020-00956-2zbMath1470.90088OpenAlexW3092658954MaRDI QIDQ2038915

Kathrin Klamroth, Gabriele Eichfelder, Julia Niebling

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-00956-2

zbMATH Keywords

global optimizationconstrained optimizationbranch and boundnonconvex optimizationmultiobjective optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Uses Software

• INTLAB
• GAMS
• MINOS
• MODIR

Cites Work

• Unnamed Item
• Unnamed Item
• Relationships between constrained and unconstrained multi-objective optimization and application in location theory
• Primal and dual approximation algorithms for convex vector optimization problems
• An approximation algorithm for convex multi-objective programming problems
• The multicriteria big cube small cube method
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
• Deterministic global optimization. Geometric branch-and-bound methods and their applications
• Constrained optimization using multiple objective programming
• Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
• Theory of multiobjective optimization
• Global minimum potential energy conformations of small molecules
• Bi-dimensional knapsack problems with one soft constraint
• Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
• A polyhedral branch-and-cut approach to global optimization
• A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
• Bi-objective decision making in global optimization based on statistical models
• Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
• Non-convex multi-objective optimization
• Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization
• A deterministic algorithm for global multi-objective optimization
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• Multicriteria Optimization
• Improved Automatic Computation of Hessian Matrix Spectral Bounds
• Nonlinear programming without a penalty function.

This page was built for publication: Nonconvex constrained optimization by a filtering branch and bound