A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
From MaRDI portal
Publication:4629343
DOI10.1137/18M1169680zbMath1414.90288MaRDI QIDQ4629343
Gabriele Eichfelder, Julia Niebling
Publication date: 22 March 2019
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
global optimizationbranch-and-bound algorithmnonconvex optimizationmultiobjective optimization\(\alpha\)BB method
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)
Related Items (18)
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems ⋮ Bi-objective design-for-control of water distribution networks with global bounds ⋮ An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ Numerical certification of Pareto optimality for biobjective nonlinear problems ⋮ Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded ⋮ An algorithmic approach to multiobjective optimization with decision uncertainty ⋮ A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs ⋮ A decision space algorithm for multiobjective convex quadratic integer optimization ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ Limit sets in global multiobjective optimization ⋮ Reference-point-based branch and bound algorithm for multiobjective optimization ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ Nonlinear biobjective optimization: improving the upper envelope using feasible line segments ⋮ Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms ⋮ Nonconvex constrained optimization by a filtering branch and bound ⋮ A general branch-and-bound framework for continuous global multiobjective optimization ⋮ Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the representation of the search region in multi-objective optimization
- Primal and dual approximation algorithms for convex vector optimization problems
- An approximation algorithm for convex multi-objective programming problems
- 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
- Multiobjective search algorithm with subdivision technique
- 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
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Global minimum potential energy conformations of small molecules
- Lipschitzian optimization without the Lipschitz constant
- Maximum electromagnetic drag configurations for a translating conducting cylinder with distant magnetic dipoles
- MultiGLODS: global and local multiobjective optimization using direct search
- A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Non-convex multi-objective optimization
- Introduction to nonlinear and global optimization
- A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming
- A Method for Constrained Multiobjective Optimization Based on SQP Techniques
- Vector Optimization
- Finding Efficient Solutions by Free Disposal Outer Approximation
- Singular Continuation: Generating Piecewise Linear Approximations to Pareto Sets via Global Analysis
- Adaptive Scalarization Methods in Multiobjective Optimization
- An Ellipsoidal Branch and Bound Algorithm for Global Optimization
- A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems
- Interval Methods for Systems of Equations
- Multicriteria optimization using a genetic algorithm for determining a Pareto set
- Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
- Multicriteria Optimization
- Proximal Methods in Vector Optimization
- Improved Automatic Computation of Hessian Matrix Spectral Bounds
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- Dual bounding procedures lead to convergent branch-and-bound algorithms
This page was built for publication: A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
