Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition (Q415403): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / review text | |||
This paper establishes global optimality conditions for quadractic optimization problems with quadratic equality and bivalent constraints. First, a necessary and sufficient condition is presented for a KKT point to be a global minimizer of a quadratic optimization problem with quadratic equality and bivalent constraints. From it, a necessary and sufficient condition for a feasible point to be a global minimizer of the same problem is derived. Then, situations are examined where this optimality condition is equivalent to checking the positive semidefiniteness of a related matrix, and so can be verified in polynomial time by using elementary eigenvalues decomposition techniques. As a consequence, simple sufficient global optimality conditions are presented, which can be verified by solving a linear matrix inequality problem. This extends several results in the existing literature. | |||
Property / review text: This paper establishes global optimality conditions for quadractic optimization problems with quadratic equality and bivalent constraints. First, a necessary and sufficient condition is presented for a KKT point to be a global minimizer of a quadratic optimization problem with quadratic equality and bivalent constraints. From it, a necessary and sufficient condition for a feasible point to be a global minimizer of the same problem is derived. Then, situations are examined where this optimality condition is equivalent to checking the positive semidefiniteness of a related matrix, and so can be verified in polynomial time by using elementary eigenvalues decomposition techniques. As a consequence, simple sufficient global optimality conditions are presented, which can be verified by solving a linear matrix inequality problem. This extends several results in the existing literature. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C26 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C46 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6031748 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bivalent constraints | |||
Property / zbMATH Keywords: bivalent constraints / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
global optimality conditions | |||
Property / zbMATH Keywords: global optimality conditions / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Fabián Flores-Bazan / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10957-011-9930-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2165056835 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59241521 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A quadratic assignment formulation of the molecular conformation problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Handbook of global optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4247438 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On some connections among variational inequalities, combinatorial and continuous optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Role of copositivity in optimality criteria for nonconvex optimization problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Second-order sufficient optimality conditions for local and global nonlinear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Copositive optimization -- recent developments and applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Variational Approach to Copositive Matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sufficient global optimality conditions for bivalent quadratic optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Necessary global optimality conditions for nonlinear programming problems with polynomial constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convexity of quadratic transformations and its use in control and optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Global optimality conditions for some classes of optimization problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4344117 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3833495 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4040931 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Definiteness and semidefiniteness of quadratic forms revisited / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 04:39, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition |
scientific article |
Statements
Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition (English)
0 references
8 May 2012
0 references
This paper establishes global optimality conditions for quadractic optimization problems with quadratic equality and bivalent constraints. First, a necessary and sufficient condition is presented for a KKT point to be a global minimizer of a quadratic optimization problem with quadratic equality and bivalent constraints. From it, a necessary and sufficient condition for a feasible point to be a global minimizer of the same problem is derived. Then, situations are examined where this optimality condition is equivalent to checking the positive semidefiniteness of a related matrix, and so can be verified in polynomial time by using elementary eigenvalues decomposition techniques. As a consequence, simple sufficient global optimality conditions are presented, which can be verified by solving a linear matrix inequality problem. This extends several results in the existing literature.
0 references
bivalent constraints
0 references
global optimality conditions
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references