Dual form reduction in the atomic optimization method
- Authors: Pozdyayev V.V.1
- 
							Affiliations: 
							- Arzamas Polytechnic Institute of Alekseev Nizhny Novgorod State Technical University
 
- Issue: Vol 78, No 5 (2017)
- Pages: 940-952
- Section: Large Scale Systems Control
- URL: https://journals.rcsi.science/0005-1179/article/view/150607
- DOI: https://doi.org/10.1134/S0005117917050150
- ID: 150607
Cite item
Abstract
One-dimensional optimization problems with a polynomial objective function and polynomial matrix inequality constraints are considered. For problems dual to their linear relaxations, a transformation is presented that makes them compatible with the atomic optimization method, both in its basic and in the generalized form with a reduced number of atoms.
About the authors
V. V. Pozdyayev
Arzamas Polytechnic Institute of Alekseev Nizhny Novgorod State Technical University
							Author for correspondence.
							Email: vpozdyayev@gmail.com
				                					                																			                												                	Russian Federation, 							Arzamas						
Supplementary files
 
				
			 
					 
						 
						 
						 
						 
				 
  
  
  
  
  Email this article
			Email this article  Open Access
		                                Open Access Access granted
						Access granted Subscription Access
		                                		                                        Subscription Access
		                                					