Dual form reduction in the atomic optimization method
In this work, the author studies one dimensional non-convex optimization problems with polynomial objective function and polynomial matrix inequality constraints for which they construct linear relaxations. The dual problems to the linear relaxations are then investigated, namely certain transformation is provided which shows that such problems are compatible with the atomic optimization method. Some reduction of the number of atoms is also given. Numerous comments allow for better understanding of the author's approach which is supplied with worked examples.
- Atomic optimization. I: Search space transformation and one-dimensional problems
- Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities
- Role of redundant constraints for improving dual bounds in polynomial optimization problems
- Polyhedral annexation, dualization and dimension reduction technique in global optimization
- Global optimization with polynomials and the problem of moments
- Atomic optimization. I: Search space transformation and one-dimensional problems
- Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
This page was built for publication: Dual form reduction in the atomic optimization method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399760)
