Nonlinear biobjective optimization: improving the upper envelope using feasible line segments

DOI10.1007/s10898-021-00991-7zbMath1465.90090OpenAlexW3127384426MaRDI QIDQ2022248

Ignacio J. Araya, Franco Ardiles, Braulio Lobo, Damir Aliquintui

Publication date: 28 April 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-021-00991-7

zbMATH Keywords

multiobjective optimizationinterval methodsbranch \& bound

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29)

Uses Software

• GitHub
• ibexMop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• An interval algorithm for multi-objective optimization
• Upper bounding in inner regions for global optimization under inequality constraints
• A reliable affine relaxation method for global optimization
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
• \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
• Contractor programming
• On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
• Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
• Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
• Trade-off analysis approach for interactive nonlinear multiobjective optimization
• First order rejection tests for multiple-objective optimization
• Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
• Non-convex multi-objective optimization
• Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
• Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
• Constructive Interval Disjunction
• Smoothed analysis of algorithms
• Subdivision Direction Selection in Interval Methods for Global Optimization
• Multiobjective Optimization
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
• Reliable minimax parameter estimation
• Benchmarking optimization software with performance profiles.

This page was built for publication: Nonlinear biobjective optimization: improving the upper envelope using feasible line segments