Error bounds for nonlinear semide nite optimization

نویسنده

  • Hiroshi Yamashita
چکیده

In this paper, error bounds for nonlinear semide nite optimization problem is considered. We assume the second order su cient condition, the strict complementarity condition and the MFCQ condition at the KKT point. The nondegeneracy condition is not assumed in this paper. Therefore the Jacobian operator of the equality part of the KKT conditions is not assumed to be invertible. We derive lower bounds for the primal and dual distances to the solution set when the primal variable is close to the solution set. Then a global error bound of the dual distance to the solution set is obtained assuming the MFCQ condition and the strict complementarity condition. An error bound for the primal variable is given when the primal-dual pair is close to the solution set, and approximately satis es the shifted complementarity condition along with the MFCQ condition and the second order su cient condition. Finally we gather these results and obtain the upper and lower local error bounds for the primal-dual pair.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semideenite Programming

In semide nite programming one minimizes a linear function subject to the constraint that an a ne combination of symmetric matrices is positive semide nite. Such a constraint is nonlinear and nonsmooth, but convex, so semide nite programs are convex optimization problems. Semide nite programming uni es several standard problems (e.g., linear and quadratic programming) and nds many applications ...

متن کامل

FIR Filter Design via Semide nite Programming and Spectral Factorization

We present a new semide nite programming approach to FIR lter design with arbitrary upper and lower bounds on the frequency response magnitude. It is shown that the constraints can be expressed as linear matrix inequalities (LMIs), and hence they can be easily handled by recent interior-point methods. Using this LMI formulation, we can cast several interesting lter design problems as convex or ...

متن کامل

A new merit function and a descent method for semide nite complementarity problems 1

Recently, Tseng extended several merit functions for the nonlinear complementarity problem to the semide nite complementarity problem (SDCP) and investigated various properties of those functions. In this paper, we propose a new merit function for the SDCP based on the squared Fischer-Burmeister function and show that it has some favorable properties. Particularly, we give conditions under whic...

متن کامل

A new merit function and a descent method for semide nite complementarity problems

Recently, Tseng extended several merit functions for the nonlinear complementarity problem to the semide nite complementarity problem (SDCP) and investigated various properties of those functions. In this paper, we propose a new merit function for the SDCP based on the squared Fischer-Burmeister function and show that it has some favorable properties. Particularly, we give conditions under whic...

متن کامل

The Extended Semide nite Linear Complementarity Problem: A Reformulation Approach

In this paper we consider the extended semide nite linear complementarity problem (XSDLCP). We propose merit functions that can constitute minimization problems equivalent to XSDLCP and show some properties of these functions. We also consider the semide nite nonlinear complementarity problem (SDNCP) and give new su cient conditions that guarantee the existence of a solution to SDNCP.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016