Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635): Difference between revisions

Latest revision as of 13:31, 7 July 2024

scientific article

Language	Label	Description	Also known as
English	Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations	scientific article

Statements

instance of

scholarly article

0 references

title

Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (English)

0 references

author

Guoyin Li

0 references

S. Srisatkunarajah

0 references

Vaithilingam Jeyakumar

0 references

published in

Journal of Global Optimization

0 references

publication date

1 April 2014

0 references

zbMATH Keywords

polynomial optimization

0 references

bivalent constraints

0 references

box constraints

0 references

global optimality conditions

0 references

global optimization

0 references

describes a project that uses

YALMIP

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10898-013-0058-x

0 references

cites work

A convex polynomial that is not sos-convex

0 references

Handbook on semidefinite, conic and polynomial optimization

0 references

Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints

0 references

Optimal Inequalities in Probability Theory: A Convex Optimization Approach

0 references

Semidefinite Optimization and Convex Algebraic Geometry

0 references

Semidefinite representation of convex sets

0 references

Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints

0 references

Handbook of global optimization

0 references

Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions

0 references

Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems

0 references

Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization

0 references

Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization

0 references

Necessary global optimality conditions for nonlinear programming problems with polynomial constraints

0 references

Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems

0 references

Polynomials nonnegative on a grid and discrete optimization

0 references

Q3601990

0 references

Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition

0 references

Pre- and Post-Processing Sum-of-Squares Programs in Practice

0 references

Second-order sufficient optimality conditions for local and global nonlinear programming

0 references

Semidefinite programming relaxations for semialgebraic problems

0 references

A quadratic assignment formulation of the molecular conformation problem

0 references

Sufficient global optimality conditions for bivalent quadratic optimization

0 references

Global optimality conditions for some classes of polynomial integer programming problems

0 references

Global optimality conditions for cubic minimization problem with box or binary constraints

0 references

Identifiers

zbMATH Open document ID

1319.90052

0 references

DOI

10.1007/s10898-013-0058-x

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2442635

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10898-013-0058-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2105061215
@@ Property / OpenAlex ID: W2105061215 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59241484
@@ Property / Wikidata QID: Q59241484 / rank @@
+Normal rank
@@ Property / cites work @@
+A convex polynomial that is not sos-convex
@@ Property / cites work: A convex polynomial that is not sos-convex / rank @@
+Normal rank
@@ Property / cites work @@
+Handbook on semidefinite, conic and polynomial optimization
+Normal rank
@@ Property / cites work @@
+Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
+Normal rank
@@ Property / cites work @@
+Optimal Inequalities in Probability Theory: A Convex Optimization Approach
+Normal rank
@@ Property / cites work @@
+Semidefinite Optimization and Convex Algebraic Geometry
+Normal rank
@@ Property / cites work @@
+Semidefinite representation of convex sets
@@ Property / cites work: Semidefinite representation of convex sets / rank @@
+Normal rank
@@ Property / cites work @@
+Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
+Normal rank
@@ Property / cites work @@
+Handbook of global optimization
@@ Property / cites work: Handbook of global optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
+Normal rank
@@ Property / cites work @@
+Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
+Normal rank
@@ Property / cites work @@
+Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
+Normal rank
@@ Property / cites work @@
+Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
+Normal rank
@@ Property / cites work @@
+Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
+Normal rank
@@ Property / cites work @@
+Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
+Normal rank
@@ Property / cites work @@
+Polynomials nonnegative on a grid and discrete optimization
+Normal rank
@@ Property / cites work @@
+Q3601990
@@ Property / cites work: Q3601990 / rank @@
+Normal rank
@@ Property / cites work @@
+Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
+Normal rank
@@ Property / cites work @@
+Pre- and Post-Processing Sum-of-Squares Programs in Practice
+Normal rank
@@ Property / cites work @@
+Second-order sufficient optimality conditions for local and global nonlinear programming
+Normal rank
@@ Property / cites work @@
+Semidefinite programming relaxations for semialgebraic problems
+Normal rank
@@ Property / cites work @@
+A quadratic assignment formulation of the molecular conformation problem
+Normal rank
@@ Property / cites work @@
+Sufficient global optimality conditions for bivalent quadratic optimization
+Normal rank
@@ Property / cites work @@
+Global optimality conditions for some classes of polynomial integer programming problems
+Normal rank
@@ Property / cites work @@
+Global optimality conditions for cubic minimization problem with box or binary constraints
+Normal rank