In this short note a sensitivity result for quadratic semidefinite programming is presented under a weak form of second order sufficient condition. Based on this result, also the local convergence of a sequential quadratic semidefinite programming algorithm extends to this weak second order sufficient condition. Mathematical subject classification: 90C22, 90C30, 90C31, 90C55
We analyze the convergence of the sequential quadratic programming (SQP) method for nonlinear progra...
In recent years, the semidefinite relaxation (SDR) technique has been at the center of some of very ...
We describe some first- and second-order optimality conditions for mathematical programs with equili...
We consider the solution of nonlinear programs with nonlinear semidefiniteness constraints. The ...
In this paper we study nonlinear semidefinite programming problems. Convexity, duality and first-ord...
We consider the solution of nonlinear programs with nonlinear semidefiniteness constraints....
We consider the solution of nonlinear programs with nonlinear semidefiniteness constraints....
In this article, a nonlinear semidefinite program is reformulated into a mathematical program with a...
A sequential quadratic programming algorithm for nonlinear programmes is described. The algorithm us...
n recent years, the semidefinite relaxation (SDR) technique has been at the center of some of very e...
An algorithm for semi-infinite programming using sequential quadratic programming techniques togeth...
In this paper we propose a global algorithm for solving nonlinear semidefinite programming problems....
summary:In this paper, we present a sensitivity result for quadratic second-order cone programming u...
In this paper we propose a global algorithm for solving nonlinear semidefinite programming problems....
We follow the popular approach for unconstrained minimization, i.e. we develop a local quadratic mod...
We analyze the convergence of the sequential quadratic programming (SQP) method for nonlinear progra...
In recent years, the semidefinite relaxation (SDR) technique has been at the center of some of very ...
We describe some first- and second-order optimality conditions for mathematical programs with equili...
We consider the solution of nonlinear programs with nonlinear semidefiniteness constraints. The ...
In this paper we study nonlinear semidefinite programming problems. Convexity, duality and first-ord...
We consider the solution of nonlinear programs with nonlinear semidefiniteness constraints....
We consider the solution of nonlinear programs with nonlinear semidefiniteness constraints....
In this article, a nonlinear semidefinite program is reformulated into a mathematical program with a...
A sequential quadratic programming algorithm for nonlinear programmes is described. The algorithm us...
n recent years, the semidefinite relaxation (SDR) technique has been at the center of some of very e...
An algorithm for semi-infinite programming using sequential quadratic programming techniques togeth...
In this paper we propose a global algorithm for solving nonlinear semidefinite programming problems....
summary:In this paper, we present a sensitivity result for quadratic second-order cone programming u...
In this paper we propose a global algorithm for solving nonlinear semidefinite programming problems....
We follow the popular approach for unconstrained minimization, i.e. we develop a local quadratic mod...
We analyze the convergence of the sequential quadratic programming (SQP) method for nonlinear progra...
In recent years, the semidefinite relaxation (SDR) technique has been at the center of some of very ...
We describe some first- and second-order optimality conditions for mathematical programs with equili...