Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
type: Item
instance of: scholarly article
title: Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
zbMATH Open document ID: 1465.90090
author: I. Araya
author: Damir Aliquintui
author: Franco Ardiles
author: Braulio Lobo
published in: Journal of Global Optimization
publication date: 2021-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7340755
zbMATH Keywords: interval methods
zbMATH Keywords: branch \& bound
zbMATH Keywords: multiobjective optimization
describes a project that uses: ibexMop
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: s10898-021-00991-7
OpenAlex ID: W3127384426
cites work: Multi-objective optimization using evolutionary algorithms
cites work: Trade-off analysis approach for interactive nonlinear multiobjective optimization
cites work: Multiobjective Optimization
cites work: Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
cites work: Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
cites work: Non-convex multi-objective optimization
cites work: An interval algorithm for multi-objective optimization
cites work: Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
cites work: Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
cites work: On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
cites work: Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
cites work: A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
cites work: Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
cites work: First order rejection tests for multiple-objective optimization
cites work: Q2713275
cites work: Q3860434
cites work: Upper bounding in inner regions for global optimization under inequality constraints
cites work: Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems. 9th international conference, CPAIOR 2012, Nantes, France, May 28--June 1, 2012. Proceedings
cites work: Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
cites work: A reliable affine relaxation method for global optimization
cites work: Reliable minimax parameter estimation
cites work: Smoothed analysis of algorithms
cites work: Contractor programming
cites work: Constructive Interval Disjunction
cites work: Subdivision Direction Selection in Interval Methods for Global Optimization
cites work: Q5566070
cites work: \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
cites work: Q5733025
cites work: Benchmarking optimization software with performance profiles.
DOI: 10.1007/S10898-021-00991-7
Recommended article: Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
Recommended article: Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
Recommended article: Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
Recommended article: Q3073824
Recommended article: An application of nonlinear optimization in molecular biology
Recommended article: Bi-objective optimization of biochemical systems by linear programming
Recommended article: On a biobjective search problem in a line: formulations and algorithms
Recommended article: Optimization of nonlinear controller with an enhanced biogeography approach
Recommended article: Nonmonotone line searches for unconstrained multiobjective optimization problems
Recommended article: Nonlinear multiobjective optimization
description: scientific article; zbMATH DE number 7340755