Here, we present some numerical experiments with a reduction method for solving nonlinear semi-infinite programming (SIP) problems. The method relies on a line search technique to ensure a sufficient decrease of a L_2-exponential merit function. The proposed merit function is continuous for SIP and improves the algorithm efficiency when compared with other previously tested merit functions. A comparison with other reduction methods is also included.The authors are grateful to three anonymous referees for their comments and suggestions. This work has been partially suported by the Algoritmi Research Center and by Portuguese FCT grant POCl/MAT/58957/2004
Semi-infinite programming (SIP) problems can be efficiently solved by reduction-type methods. Here, ...
In this paper, a reduction-type method combined with a line search filter method to solve nonlinear ...
Abstract: In this paper, a reduction-type method combined with a line search filter method to solve ...
Here, we present some numerical experiments with a reduction method for solving nonlinear semi-infin...
We describe a reduction algorithm for solving semi-infinite programming problems. The proposed algor...
This paper presents a new reduction-type method for solving semi-infinite programming problems, wher...
In this paper, a reduction-type method combined with a line search filter method to solve nonlinear ...
To solve nonlinear semi-infinite programming problems we use a global reduction method. The method r...
We present a review of reduction type methods to solve nonlinear semi-infinite programming problems....
Semi-infinite programming (SIP) problems can be efficiently solved by reduction type methods. Here,...
We present a reduction type algorithm for solving nonlinear semi-infinite programming problems. The ...
Semi-infinite programming (SIP) problems can be efficiently solved by reduction type methods. Here, ...
Semi-infinite programming (SIP) problems are characterized by a finite number of variables and an in...
In this talk, some variants of reduction-type method combined with a line search filter method to s...
Semi-infinite programming problems can be efficiently solved by reduction type methods. Here, we pre...
Semi-infinite programming (SIP) problems can be efficiently solved by reduction-type methods. Here, ...
In this paper, a reduction-type method combined with a line search filter method to solve nonlinear ...
Abstract: In this paper, a reduction-type method combined with a line search filter method to solve ...
Here, we present some numerical experiments with a reduction method for solving nonlinear semi-infin...
We describe a reduction algorithm for solving semi-infinite programming problems. The proposed algor...
This paper presents a new reduction-type method for solving semi-infinite programming problems, wher...
In this paper, a reduction-type method combined with a line search filter method to solve nonlinear ...
To solve nonlinear semi-infinite programming problems we use a global reduction method. The method r...
We present a review of reduction type methods to solve nonlinear semi-infinite programming problems....
Semi-infinite programming (SIP) problems can be efficiently solved by reduction type methods. Here,...
We present a reduction type algorithm for solving nonlinear semi-infinite programming problems. The ...
Semi-infinite programming (SIP) problems can be efficiently solved by reduction type methods. Here, ...
Semi-infinite programming (SIP) problems are characterized by a finite number of variables and an in...
In this talk, some variants of reduction-type method combined with a line search filter method to s...
Semi-infinite programming problems can be efficiently solved by reduction type methods. Here, we pre...
Semi-infinite programming (SIP) problems can be efficiently solved by reduction-type methods. Here, ...
In this paper, a reduction-type method combined with a line search filter method to solve nonlinear ...
Abstract: In this paper, a reduction-type method combined with a line search filter method to solve ...