Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization

نویسندگان

  • Vaithilingam Jeyakumar
  • G. M. Lee
  • Guoyin Li
چکیده

We establish alternative theorems for quadratic inequality systems. Consequently, we obtain Lagrange multiplier characterizations of global optimality for classes of non-convex quadratic optimization problems. We present a generalization of Dine’s theorem to a system of two homogeneous quadratic functions with a regular cone. The class of regular cones are cones K for which (K∪−K) is a subspace. As a consequence, we establish a generalization of the powerful S-lemma, which paves the way to obtain a complete characterization of global optimality for a general quadratic optimization model problem involving also a system of equality constraints in addition to a single quadratic inequality constraint. We then present an alternative theorem for a system of three non-homogeneous inequalities by way of establishing the convexity of the joint-range of three homogeneous quadratic functions using a regular cone. This yields Lagrange multiplier characterizations of global optimality for classes of trust-region type problems with two inequality constraints. Finally, we establish an alternative theorem for systems involving an arbitrary finite number of quadratic inequalities involving Z-matrices, which are matrices with non-positive off diagonal elements, and present necessary and sufficient conditions for global optimality for classes of non-convex inequality constrained quadratic optimization problems. ∗Research of the first author was supported by the Australian Research Council. The second author was supported by the Korea Science and Engineering Foundation NRL Program grant funded by the Korea government (No. ROA-2008-000-20010-0). †Department of Applied Mathematics, University of New South Wales, Sydney 2052, Australia. E-mail: [email protected] ‡Department of Applied Mathematics, Pukyong National University, Pusan 608-737, Korea. E-mail:[email protected] §Department of Applied Mathematics, University of New South Wales, Sydney 2052, Australia. E-mail: [email protected]

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

ثبت نام

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

منابع مشابه

A New Class of Alternative Theorems for SOS-Convex Inequalities and Robust Optimization∗

In this paper we present a new class of theorems of the alternative for SOS-convex inequality systems without any qualifications. This class of theorems provides an alternative equations in terms of sums of squares to the solvability of the given inequality system. A strong separation theorem for convex sets, described by convex polynomial inequalities, plays a key role in establishing the clas...

متن کامل

Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition

In this paper, we establish global optimality conditions for quadratic optimization problems with quadratic equality and bivalent constraints. We first present a necessary and sufficient condition for a global minimizer of quadratic optimization problems with quadratic equality and bivalent constraints. Then, we examine situations where this optimality condition is equivalent to checking the po...

متن کامل

A Semidefinite Optimization Approach to Quadratic Fractional Optimization with a Strictly Convex Quadratic Constraint

In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...

متن کامل

A NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS

Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...

متن کامل

Necessary and Sufficient Conditions for S-Lemma and Nonconvex Quadratic Optimization∗

The celebrated S-lemma establishes a powerful equivalent condition for the nonnegativity of a quadratic function over a single quadratic inequality. However, this lemma fails without the technical condition, known as the Slater condition. In this paper, we first show that the Slater condition is indeed necessary for the S-lemma and then establishes a regularized form of the S-lemma in the absen...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • SIAM Journal on Optimization

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2009