An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Mathematical Programming: Series A and B
What every computer scientist should know about floating-point arithmetic
ACM Computing Surveys (CSUR)
New applications of Taylor model methods
Automatic differentiation of algorithms
Exclusion Regions for Systems of Equations
SIAM Journal on Numerical Analysis
Interval Analysis on Directed Acyclic Graphs for Global Optimization
Journal of Global Optimization
Multiobjective Search Algorithm with Subdivision Technique
Computational Optimization and Applications
Transposition Theorems and Qualification-Free Optimality Conditions
SIAM Journal on Optimization
Optimization Methods & Software - GLOBAL OPTIMIZATION
Interval propagation and search on directed acyclic graphs for numerical constraint solving
Journal of Global Optimization
Interval Gaussian Elimination with Pivot Tightening
SIAM Journal on Matrix Analysis and Applications
A population and interval constraint propagation algorithm
EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
An improved interval global optimization method and its application to price management problem
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Interval methods for computing the Pareto-front of a multicriterial problem
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Interval computations, rigour and non-rigour in deterministic continuous global optimization
Optimization Methods & Software
Using the second-order information in pareto-set computations of a multi-criteria problem
PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2
| Hi-index | 0.00 |
Three rejection tests for multi-objective optimization problems based on first order optimality conditions are proposed. These tests can certify that a box does not contain any local minimizer, and thus it can be excluded from the search process. They generalize previously proposed rejection tests in several regards: Their scope include inequality and equality constrained smooth or nonsmooth multiple objective problems. Reported experiments show that they allow quite efficiently removing the cluster effect in mono-objective and multi-objective problems, which is one of the key issues in continuous global deterministic optimization.