Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
From MaRDI portal
Publication:2022248
Recommendations
- Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Biobjective programming in optimization of interval linear programming
- An application of nonlinear optimization in molecular biology
- Bi-objective optimization of biochemical systems by linear programming
- On a biobjective search problem in a line: formulations and algorithms
- Optimization of nonlinear controller with an enhanced biogeography approach
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- Nonlinear multiobjective optimization
Cites work
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- A reliable affine relaxation method for global optimization
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- An interval algorithm for multi-objective optimization
- Benchmarking optimization software with performance profiles.
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
- Constructive Interval Disjunction
- Contractor programming
- Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
- First order rejection tests for multiple-objective optimization
- scientific article; zbMATH DE number 1595639 (Why is no real title available?)
- scientific article; zbMATH DE number 3662118 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 3196641 (Why is no real title available?)
- 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
- Multi-objective optimization using evolutionary algorithms
- Multiobjective Optimization
- Non-convex multi-objective optimization
- Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
- Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
- Reliable minimax parameter estimation
- Smoothed analysis of algorithms
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Trade-off analysis approach for interactive nonlinear multiobjective optimization
- Upper bounding in inner regions for global optimization under inequality constraints
Cited in
(4)- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
- Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
- Extending interval branch-and-bound from two to few objectives in nonlinear multiobjective optimization
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
This page was built for publication: Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2022248)
