Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
From MaRDI portal
Publication:415403
DOI10.1007/S10957-011-9930-3zbMATH Open1262.90121DBLPjournals/jota/Li12OpenAlexW2165056835WikidataQ59241521 ScholiaQ59241521MaRDI QIDQ415403FDOQ415403
Authors: G. Li 
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
Recommendations
- Sufficient global optimality conditions for bivalent quadratic optimization
- On sufficient global optimality conditions for bivalent quadratic programs with quadratic constraints
- New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problems
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- Global optimality conditions for quadratic optimization problems with binary constraints
Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- Handbook of global optimization
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Convexity of quadratic transformations and its use in control and optimization
- Global optimality conditions for quadratic optimization problems with binary constraints
- Alternative theorems for quadratic inequality systems and global quadratic optimization
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- Sufficient global optimality conditions for bivalent quadratic optimization
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- A variational approach to copositive matrices
- Title not available (Why is that?)
- Global optimality conditions for some classes of optimization problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Title not available (Why is that?)
- Copositive optimization -- recent developments and applications
- On some connections among variational inequalities, combinatorial and continuous optimization
- A quadratic assignment formulation of the molecular conformation problem
- Role of copositivity in optimality criteria for nonconvex optimization problems
- Second-order sufficient optimality conditions for local and global nonlinear programming
- Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Definiteness and semidefiniteness of quadratic forms revisited
Cited In (18)
- The exact extreme response and the confidence extreme response analysis of structures subjected to uncertain-but-bounded excitations
- New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problems
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
- The unconstrained binary quadratic programming problem: a survey
- Sufficient global optimality conditions for bivalent quadratic optimization
- On sufficient global optimality conditions for bivalent quadratic programs with quadratic constraints
- Global minimization of difference of quadratic and convex functions over box or binary constraints
- Global optimality conditions and optimization methods for quadratic assignment problems
- First- and second-order optimality conditions for quadratically constrained quadratic programming problems
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- An optimality criterion for global quadratic optimization
- CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
- A sufficient conditions for global quadratic optimization
- Global optimality conditions for quadratic optimization problems with binary constraints
- Global optimality conditions for cubic minimization problems with cubic constraints
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- A filled function method for quadratic programs with binary constraints†
- Global optimality of quadratic minimization over symmetric polytopes
This page was built for publication: Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415403)
