Atomic optimization. I. Search Space Transformation and One-dimensional Problems

Authors:
V. V. Pozdyayev
Affiliations:
Arzamas Polytechnic Institute of Alekseev Nizhni Novgorod State Technical University, Arzamas, Russia
Venue:
Automation and Remote Control
Year:
2013

Citing 6
Cited 0

Parametrization of all stabilizing controllers via quadratic Lyapunov functions

Journal of Optimization Theory and Applications
NP-Hardness of Some Linear Control Design Problems

SIAM Journal on Control and Optimization
Parameterized LMIs in Control Theory

SIAM Journal on Control and Optimization
Global Optimization with Polynomials and the Problem of Moments

SIAM Journal on Optimization
Convex Optimization

Convex Optimization
GloptiPoly 3: moments, optimization and semidefinite programming

Optimization Methods & Software - GLOBAL OPTIMIZATION

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper studies optimization problems with polynomial objective functions and constraints in the form of inequalities. We propose a transformation of the solution method based on the theory of moments. This transformation allows to construct equivalent solution algorithms in the augmented original search space instead of the space of moments. Onedimensional optimization problems are explored in detail.