Bound-constrained minimization is a subject of active research. To assess the performance of existent solvers, numerical evaluations and comparisons are carried on. Arbitrary decisions that may have a crucial effect on the conclusions of numerical experiments are highlighted in the present work. As a result, a detailed evaluation based on performance profiles is applied to the comparison of bound-constrained minimization solvers. Extensive numerical results are presented and analyzed
In the context of Constraint Programming, a portfolio approach exploits the complementary strengths ...
In this study, two solution approaches are compared for a real-world, moderate-size but a highly con...
Includes bibliographical references (pages 112-113)The study is a discussion of particular methodolo...
This paper presents an evaluation of the design decisions made in four state-of-the-art constraint s...
International audienceBound constraints on the variables are the most basic constraints in an optimi...
This discussion focuses on the constrained optimization problem and looks into different methods for...
Many practical optimization problems are constrained, and have a bounded search space. In this paper...
We examine the influence of optimality measures on the benchmarking process, and show that scaling r...
Results are reported of testing a number of existing state of the art solvers for global constrained...
AbstractA family of algorithms for the approximate solution of the bound-constrained minimization pr...
Abstract: It is of practical interest to identify which processes will benefit significantly from th...
. Various techniques have been proposed for incorporating constraints in interval branch and bound a...
Symbolic execution tools query constraint solvers for tasks such as determining the feasibility of p...
International audienceContext: Testing highly-configurable software systems is challenging due to a ...
Our work under this support broadly falls into five categories: automatic differentiation, sparsity,...
In the context of Constraint Programming, a portfolio approach exploits the complementary strengths ...
In this study, two solution approaches are compared for a real-world, moderate-size but a highly con...
Includes bibliographical references (pages 112-113)The study is a discussion of particular methodolo...
This paper presents an evaluation of the design decisions made in four state-of-the-art constraint s...
International audienceBound constraints on the variables are the most basic constraints in an optimi...
This discussion focuses on the constrained optimization problem and looks into different methods for...
Many practical optimization problems are constrained, and have a bounded search space. In this paper...
We examine the influence of optimality measures on the benchmarking process, and show that scaling r...
Results are reported of testing a number of existing state of the art solvers for global constrained...
AbstractA family of algorithms for the approximate solution of the bound-constrained minimization pr...
Abstract: It is of practical interest to identify which processes will benefit significantly from th...
. Various techniques have been proposed for incorporating constraints in interval branch and bound a...
Symbolic execution tools query constraint solvers for tasks such as determining the feasibility of p...
International audienceContext: Testing highly-configurable software systems is challenging due to a ...
Our work under this support broadly falls into five categories: automatic differentiation, sparsity,...
In the context of Constraint Programming, a portfolio approach exploits the complementary strengths ...
In this study, two solution approaches are compared for a real-world, moderate-size but a highly con...
Includes bibliographical references (pages 112-113)The study is a discussion of particular methodolo...