AbstractWe develop a procedure for verifying the correctness and accuracy of a candidate point for local constrained minimum, using interval methods. Our approach is based on multiplier penalty functions and assumes that the minimum satisfies second order sufficient conditions. A few numerical examples illustrate the method
In many practically useful cases, we know how to efficiently compute the exact range of a function o...
AbstractAn interval algorithm for bounding the solutions of a constrained global optimization proble...
International audienceWe study the problem of finding the global optimum of a nonlinear real functio...
AbstractWe develop a procedure for verifying the correctness and accuracy of a candidate point for l...
Various algorithms can compute approximate feasible points or approximate solutions to equality and ...
Constraint programming is often associated with solving problems over finite domains. Many applicati...
. Various techniques have been proposed for incorporating constraints in interval branch and bound a...
AbstractWe give a short overview of the general ideas involved in solving optimization problems usin...
Since about thirty years, interval Branch and Bound algorithms are increasingly used to solve constr...
Since about thirty years, interval Branch and Bound algorithms are increasingly used to solve constr...
International audienceMINLP problems are hard constrained optimization problems, with nonlinear cons...
AbstractInterval analysis provides a tool for (i) forward error analysis, (ii) estimating and contro...
AbstractIn a recent paper by Aberth and Schaefer (1992), it was shown how an implementation of range...
Numerous efforts in the literature are devoted to studying error bounds in optimization problems. Th...
In this paper, a new objective penalty function approach is proposed for solving minimax programming...
In many practically useful cases, we know how to efficiently compute the exact range of a function o...
AbstractAn interval algorithm for bounding the solutions of a constrained global optimization proble...
International audienceWe study the problem of finding the global optimum of a nonlinear real functio...
AbstractWe develop a procedure for verifying the correctness and accuracy of a candidate point for l...
Various algorithms can compute approximate feasible points or approximate solutions to equality and ...
Constraint programming is often associated with solving problems over finite domains. Many applicati...
. Various techniques have been proposed for incorporating constraints in interval branch and bound a...
AbstractWe give a short overview of the general ideas involved in solving optimization problems usin...
Since about thirty years, interval Branch and Bound algorithms are increasingly used to solve constr...
Since about thirty years, interval Branch and Bound algorithms are increasingly used to solve constr...
International audienceMINLP problems are hard constrained optimization problems, with nonlinear cons...
AbstractInterval analysis provides a tool for (i) forward error analysis, (ii) estimating and contro...
AbstractIn a recent paper by Aberth and Schaefer (1992), it was shown how an implementation of range...
Numerous efforts in the literature are devoted to studying error bounds in optimization problems. Th...
In this paper, a new objective penalty function approach is proposed for solving minimax programming...
In many practically useful cases, we know how to efficiently compute the exact range of a function o...
AbstractAn interval algorithm for bounding the solutions of a constrained global optimization proble...
International audienceWe study the problem of finding the global optimum of a nonlinear real functio...
DOI
Add to ORKG