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
An algorithm for nding a large feasible n-dimensional interval for constrained global optimization i...
For minimization problems with equality and inequality constraints, first-and second-order necessary...
The aim of this paper is to show that the new continuously differentiable exact penalty functions re...
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 ...
In this paper, a new objective penalty function approach is proposed for solving minimax programming...
Abstract — A numerical method is suggested to find all local minima and the global minimum of an unk...
International audienceBound constrained global optimization problems can be solved by interval branc...
. Various techniques have been proposed for incorporating constraints in interval branch and bound a...
This paper introduces a new exact and smooth penalty function to tackle constrained min-max problems...
AbstractFinding feasible points is important in optimization. There are currently two major classes ...
International audienceWe study the problem of finding the global optimum of a nonlinear real functio...
AbstractInterval analysis provides a tool for (i) forward error analysis, (ii) estimating and contro...
AbstractAn interval algorithm for bounding the solutions of a constrained global optimization proble...
Properties and construction principles of a satisfactory approximation for the set of admissible sol...
An algorithm for nding a large feasible n-dimensional interval for constrained global optimization i...
For minimization problems with equality and inequality constraints, first-and second-order necessary...
The aim of this paper is to show that the new continuously differentiable exact penalty functions re...
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 ...
In this paper, a new objective penalty function approach is proposed for solving minimax programming...
Abstract — A numerical method is suggested to find all local minima and the global minimum of an unk...
International audienceBound constrained global optimization problems can be solved by interval branc...
. Various techniques have been proposed for incorporating constraints in interval branch and bound a...
This paper introduces a new exact and smooth penalty function to tackle constrained min-max problems...
AbstractFinding feasible points is important in optimization. There are currently two major classes ...
International audienceWe study the problem of finding the global optimum of a nonlinear real functio...
AbstractInterval analysis provides a tool for (i) forward error analysis, (ii) estimating and contro...
AbstractAn interval algorithm for bounding the solutions of a constrained global optimization proble...
Properties and construction principles of a satisfactory approximation for the set of admissible sol...
An algorithm for nding a large feasible n-dimensional interval for constrained global optimization i...
For minimization problems with equality and inequality constraints, first-and second-order necessary...
The aim of this paper is to show that the new continuously differentiable exact penalty functions re...