Add to ORKGA globally convergent algorithm is presented for the solution of a wide class of semi-infinite programming problems. The method is based on the solution of a sequence of equality constrained quadratic programming problems, and usually has a second order convergence rate. Numerical results illustrating the effectiveness of the method are given
An algorithm for nonlinear programming problems with equality constraints is presented which is glob...
We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) probl...
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidef-inite programming ...
International audienceWe focus on convex semi-infinite programs with an infinite number of quadratic...
An algorithm for semi-infinite programming using sequential quadratic programming techniques togeth...
We focus on convex semi-infinite programs with an infinite number of quadratically parametrized cons...
We present a smooth augmented Lagrangian algorithm for semiinfinite programming (SIP). For this algo...
We consider the global and local convergence properties of a class of augmented Lagrangian methods f...
Abstract. In this paper, a truncated projected Newton-type algorithm is presented for solving large-...
AbstractThis paper discusses a class of linear semi-infinite programming problems with finite number...
AbstractA new approach for semi-infinite programming problems is presented, which belongs to the cla...
In this paper we apply the projected Newton-type algorithm to solve semi-infinite programming proble...
Abstract We consider the class of semi-infinite programming problems which became in recent years a ...
In this paper we present some semismooth Newton methods for solving the semi-infinite programming pr...
Abstract. The global and local convergence properties of a class of augmented Lagrangian methods for...
An algorithm for nonlinear programming problems with equality constraints is presented which is glob...
We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) probl...
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidef-inite programming ...
International audienceWe focus on convex semi-infinite programs with an infinite number of quadratic...
An algorithm for semi-infinite programming using sequential quadratic programming techniques togeth...
We focus on convex semi-infinite programs with an infinite number of quadratically parametrized cons...
We present a smooth augmented Lagrangian algorithm for semiinfinite programming (SIP). For this algo...
We consider the global and local convergence properties of a class of augmented Lagrangian methods f...
Abstract. In this paper, a truncated projected Newton-type algorithm is presented for solving large-...
AbstractThis paper discusses a class of linear semi-infinite programming problems with finite number...
AbstractA new approach for semi-infinite programming problems is presented, which belongs to the cla...
In this paper we apply the projected Newton-type algorithm to solve semi-infinite programming proble...
Abstract We consider the class of semi-infinite programming problems which became in recent years a ...
In this paper we present some semismooth Newton methods for solving the semi-infinite programming pr...
Abstract. The global and local convergence properties of a class of augmented Lagrangian methods for...
An algorithm for nonlinear programming problems with equality constraints is presented which is glob...
We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) probl...
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidef-inite programming ...