KKT-based primal-dual exactness conditions for the Shor relaxation

نویسندگان

چکیده

In this work we present some exactness conditions for the Shor relaxation of diagonal (or, more generally, diagonalizable) QCQPs, which extend introduced in different recent papers about same topic. It is shown that equivalent to two convex quadratic relaxations. Then, sufficient relaxations are derived from their KKT systems. will be that, cases, by derivation previous literature, can viewed as dual conditions, since they only involve Lagrange multipliers appearing systems, extended primal-dual also primal variables

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

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

منابع مشابه

A primal-dual symmetric relaxation for homogeneous conic systems

We address the feasibility (existence of non-trivial solutions) of the pair of alternative conic systems of constraints

متن کامل

Lecture 12 : KKT conditions

The Lagrange dual function is: g(u, v) = min x L(x, u, v) The corresponding dual problem is: maxu,v g(u, v) subject to u ≥ 0 The Lagrange dual function can be viewd as a pointwise maximization of some affine functions so it is always concave. The dual problem is always convex even if the primal problem is not convex. For any primal problem and dual problem, the weak duality always holds: f∗ ≥ g...

متن کامل

Primal-dual path-following algorithms for circular programming

Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...

متن کامل

A primal - dual schema based approximation algorithm for the

The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint paths. The edge version is by now well understood from the viewpoint of approximation algorithms, but very little is known about the vertex version. Our problem, which is interesting in its own right, should shed light o...

متن کامل

The Primal - dual Algorithm

As we have seen before, using strong duality, we know that the optimum value for the following two linear programming are equal, i.e. u = w, if they are both feasible. u = max{cx : Ax ≤ b, x ≥ 0} (P ) w = min{b y : A y ≥ c, y ≥ 0} (D) Using the above result, we can check the optimality of a primal and/or a dual solution. Theorem 1. Suppose x and y are feasible solutions to (P ) and (D). Then x ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Global Optimization

سال: 2022

ISSN: ['1573-2916', '0925-5001']

DOI: https://doi.org/10.1007/s10898-022-01258-5