Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
From MaRDI portal
Publication:415403
DOI10.1007/s10957-011-9930-3zbMath1262.90121WikidataQ59241521 ScholiaQ59241521MaRDI QIDQ415403
Publication date: 8 May 2012
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9930-3
90C26: Nonconvex programming, global optimization
90C20: Quadratic programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming, The unconstrained binary quadratic programming problem: a survey, Global optimality conditions for cubic minimization problems with cubic constraints, The exact extreme response and the confidence extreme response analysis of structures subjected to uncertain-but-bounded excitations, Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- Copositive optimization -- recent developments and applications
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- Sufficient global optimality conditions for bivalent quadratic optimization
- Definiteness and semidefiniteness of quadratic forms revisited
- Global optimality conditions for some classes of optimization problems
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- A quadratic assignment formulation of the molecular conformation problem
- Role of copositivity in optimality criteria for nonconvex optimization problems
- Handbook of global optimization
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- On some connections among variational inequalities, combinatorial and continuous optimization
- Convexity of quadratic transformations and its use in control and optimization
- Second-order sufficient optimality conditions for local and global nonlinear programming
- Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Global Optimization with Polynomials and the Problem of Moments
- A Variational Approach to Copositive Matrices
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
