First order rejection tests for multiple-objective optimization

DOI10.1007/s10898-013-0066-xzbMath1301.90082OpenAlexW2041107958MaRDI QIDQ2250111

Brice Chevalier, Ferenc Domes, Alexandre Goldsztejn

Publication date: 4 July 2014

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

Full work available at URL: https://doi.org/10.1007/s10898-013-0066-x

zbMATH Keywords

interval analysisbranch and bound algorithmfirst-order optimality conditionscluster effectmulti-objective deterministic global optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Numerical certification of Pareto optimality for biobjective nonlinear problems, A branch and bound algorithm for quantified quadratic programming, A computational study of global optimization solvers on two trust region subproblems, The cluster problem in constrained global optimization, A survey of interval algorithms for solving multicriteria analysis problems, Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization, Nonlinear biobjective optimization: improving the upper envelope using feasible line segments, Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms, A standard branch-and-bound approach for nonlinear semi-infinite problems, Constraint aggregation for rigorous global optimization

Uses Software

• Mathematica
• PROFIL/BIAS
• GLOPTLAB
• INTLAB
• gaol

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interval robust multi-objective algorithm
• An interval algorithm for multi-objective optimization
• Interval analysis on directed acyclic graphs for global optimization
• Multiobjective search algorithm with subdivision technique
• Multicriterion optimization using interval analysis
• A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
• Interval propagation and search on directed acyclic graphs for numerical constraint solving
• An interval branch and bound algorithm for bound constrained optimization problems
• The cluster problem in multivariate global optimization
• PROFIL/BIAS - A fast interval library
• Bounds for Lagrange multipliers and optimal points
• Interval computations, rigour and non-rigour in deterministic continuous global optimization
• G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
• Interval Gaussian Elimination with Pivot Tightening
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Interval Methods for Systems of Equations
• Exclusion Regions for Systems of Equations
• Transposition Theorems and Qualification‐Free Optimality Conditions
• Artificial Evolution
• Global Optimization and Constraint Satisfaction