We develop an iterative method for solving the KKT system of the semi-infinite programming (SIP) problem. At each iteration, we solve the KKT system of a nonlinear programming problem with finite constraints by a semismooth Newton method. The algorithm either terminates at a KKT point of the SIP problem in finitely many iterations or generates an infinite sequence of iterates whose any accumulation point is a KKT point of the problem. We also analyse the convergence rate of the method. Preliminary numerical results are reported
Abstract: A new interface between MATLAB and SIPAMPL was created, allowing the MATLAB semi-infinite ...
Optimisation problems occur in many branches of science, engineering, and economics, as well as in o...
A Common strategy for achieving global convergence in the solution of semi-infinite programming (SIP...
We consider a semismooth reformulation of the KKT system arising from the semi-infinite programming ...
In this paper we present some semismooth Newton methods for solving the semi-infinite programming pr...
In this paper we apply the projected Newton-type algorithm to solve semi-infinite programming proble...
AbstractIn this paper, we first transform the semi-infinite programming problem into the KKT system ...
Generalized semi-infinite optimization problems (GSIP) are considered. It is investigated how the nu...
Semi-infinite programming, KKT condition, Semismooth equations, Smoothing Newton method,
We study convergence of a semismooth Newton method for generalized semi-infinite programming problem...
AbstractThis paper discusses a class of linear semi-infinite programming problems with finite number...
Abstract. Semi-infinite programming (SIP) problems can be efficiently solved by reduction type metho...
Generalized semi-infinite optimization problems (GSIP) are considered. The difference between GSIP a...
Abstract. This paper is concerned with numerical methods for solving a semi-infinite programming pro...
In this paper, we present a new method to solve linear semi-infinite programming. This method bases ...
Abstract: A new interface between MATLAB and SIPAMPL was created, allowing the MATLAB semi-infinite ...
Optimisation problems occur in many branches of science, engineering, and economics, as well as in o...
A Common strategy for achieving global convergence in the solution of semi-infinite programming (SIP...
We consider a semismooth reformulation of the KKT system arising from the semi-infinite programming ...
In this paper we present some semismooth Newton methods for solving the semi-infinite programming pr...
In this paper we apply the projected Newton-type algorithm to solve semi-infinite programming proble...
AbstractIn this paper, we first transform the semi-infinite programming problem into the KKT system ...
Generalized semi-infinite optimization problems (GSIP) are considered. It is investigated how the nu...
Semi-infinite programming, KKT condition, Semismooth equations, Smoothing Newton method,
We study convergence of a semismooth Newton method for generalized semi-infinite programming problem...
AbstractThis paper discusses a class of linear semi-infinite programming problems with finite number...
Abstract. Semi-infinite programming (SIP) problems can be efficiently solved by reduction type metho...
Generalized semi-infinite optimization problems (GSIP) are considered. The difference between GSIP a...
Abstract. This paper is concerned with numerical methods for solving a semi-infinite programming pro...
In this paper, we present a new method to solve linear semi-infinite programming. This method bases ...
Abstract: A new interface between MATLAB and SIPAMPL was created, allowing the MATLAB semi-infinite ...
Optimisation problems occur in many branches of science, engineering, and economics, as well as in o...
A Common strategy for achieving global convergence in the solution of semi-infinite programming (SIP...