The paper proposes a technique of improving the dual estimates in nonconvex multiextremal problems of mathematical programming by adding some additional constraints which are the consequences of the original constraints as follows: Let a (bounded-from-below) polynomial \(P(x_ 1,x_ 2,\dots,x_ n)\) be given and let \(P^*\) be the value of the polynomial at the global minimum point. By introducing new variables and making use of quadratic substitutions of the form: \(x^ 2_ i=y_ i\); \(x_ j x_ k=z_{kj}\), and so forth, we can reduce the minimization problem for the polynomial \(P(x_ 1,x_ 2,\dots,x_ n)\) to a quadratic extremal problem with constraints in the form of equalities. This technique is used for problems of finding the global optimum of polynomial functions, and extremal quadratic and Boolean quadratic problems. Also, the paper considers an ecological multiextremal problem and gives an algorithm for finding the dual estimate for it. The algorithm is based on a scheme of decomposition and nonsmooth optimization methods.
- Role of redundant constraints for improving dual bounds in polynomial optimization problems
- scientific article; zbMATH DE number 16323
- scientific article; zbMATH DE number 4070633
- Method of obtaining estimates in quadratic extremal problems with Boolean variables
- Dual quadratic estimates in polynomial and Boolean programming
- Modified \(r\)-algorithm to find the global minimum of polynomial functions
- Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday)
- Some directions and results of research in mathematical programming and system analysis
- Hilbert's 17th problem and best dual bounds in quadratic minimization
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- On subspace properties of the quadratically constrained quadratic program
- Global optimization for sum of generalized fractional functions
- On the extremal structure of least upper bound norms and their dual
- Method of obtaining estimates in quadratic extremal problems with Boolean variables
- Computation of the distance to semi-algebraic sets
- scientific article; zbMATH DE number 3238297 (Why is no real title available?)
- Mathematical properties of optimization problems defined by positively homogeneous functions
- The MIN-cut and vertex separator problem
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- An approach to determining Shor's dual quadratic estimates
This page was built for publication: Dual estimates in multiextremal problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201906)
