An approach to obtaining global extremums in polynomial mathematical programming problems
Any mathematical programming problem having polynomial objective function and constraints is converted, after some simple transformations, into an equivalent problem (P) consisting in minimizing a quadratic function \(K_ 0(x)\) subject to quadratic equality constraints \(K_ i(x)=0\), \(i=1,...,m\). Let \(\Omega\) (resp. \({\bar \Omega}\)) be the set of vectors \(u=(u_ 1,...,u_ m)\) for which the symmetric matrix corresponding to the quadratic part of the Lagrange function \[ L(x,u)\quad =\quad K_ 0(x)\quad +\quad \sum^{m}_{i=1}u_ iK_ i(x) \] is positive (resp. non-negative) definite. A simple proof of the equality \[ \inf \{K_ 0(x)/K_ i(x)\quad =\quad 0,\quad i=1,...,m\}\quad =\quad \sup_{u\in \Omega}\min_{x}L(x,u), \] under the assumption that the latter supremum is attained at some \(u\in \Omega\), is given. Furthermore, it is proved that a convenient reformulation, as a problem of type (P), of the unconstrained minimization of a polynomial of one variable and even degree satisfies this equality and the supremum is attained at some \(u\in {\bar \Omega}\).
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
- Modified \(r\)-algorithm to find the global minimum of polynomial functions
- Role of redundant constraints for improving dual bounds in polynomial optimization problems
- Tight size-degree bounds for sums-of-squares proofs
- Notes on computational-to-statistical gaps: predictions using statistical physics
- Limitations of semidefinite programs for separable states and entangled games
- Some directions and results of research in mathematical programming and system analysis
- Noisy tensor completion via the sum-of-squares hierarchy
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
- Mean estimation with sub-Gaussian rates in polynomial time
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
- Complete solutions and extremality criteria to polynomial optimization problems
- Die normalform des quadratischen optimierungsproblems and die pol-polaren-theorie
- Query complexity in expectation
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- Class of global minimum bounds of polynomial functions
- On N. Z. Shor's three scientific ideas
- Global optimization of polynomials restricted to a smooth variety using sums of squares
- Greedy approaches to symmetric orthogonal tensor decomposition
- The Lovász theta function for random regular graphs and community detection in the hard regime
- Disordered systems insights on computational hardness
- Sum of squares lower bounds from symmetry and a good story
- The Lovász theta function for random regular graphs and community detection in the hard regime
- scientific article; zbMATH DE number 2208673 (Why is no real title available?)
- The Spectrum of the Grigoriev–Laurent Pseudomoments
- Sum-of-squares lower bounds for densest k-subgraph
- Trajectory generation for the unicycle model using semidefinite relaxations
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints
- Scientific legacy of academician N. Z. Shor
- Relaxations of KKT conditions do not strengthen finite RLT and SDP-RLT bounds for nonconvex quadratic programs
- On global optimizations with polynomials
This page was built for publication: An approach to obtaining global extremums in polynomial mathematical programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801357)