Abstract
When studying complex optimization and control problems for systems described by polynomial and analytic functions, there is often a need to use necessary and sufficient optimality conditions. Moreover, if the known conditions turn out to be inapplicable, it is required to develop as subtle conditions as possible. This problem is studied in this article. The necessary and sufficient conditions for a local extremum are formulated for polynomials and power series. With a small number of variables, these conditions can be tested using practically implemented algorithms. The main ideas of the proposed methods involve using the Newton polytope for a polynomial (power series) and the expansion of a polynomial (power series) into a sum of quasi-homogeneous polynomial forms. The obtained results provide the practically applicable methods and algorithms necessary for solving complex problems of optimization and control of systems, which are described by polynomial and analytical functions. Specific examples of tasks in which the proposed technique can be used are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
F. P. Vasil’ev, Numerical Methods for Solving Extremal Problems (Nauka, Moscow, 1980) [in Russian].
V. N. Nefedov, “Necessary and sufficient conditions for a local minimum in polynomial minimization problems,” (MAI, Moscow, 1989), VINITI No. 6830-V89, November 2, 1989.
V. N. Nefedov, “Error estimation in convex polynomial optimization problems,” Zh. Vychisl. Mat. Mat. Fiz. 30 (2) 200–216 (1990).
V. N. Nefedov, “Necessary and sufficient conditions of extremum in analytical optimization problems,” Tr. MAI: Mat., No. 33 (2009).
S. G. Gindikin, “Energy estimates connected with Newton polyhedron,” Tr. Mosk. Mat. Ob-va 31, 189–236 (1974).
A. D. Bryuno, Power Geometry in Algebraic and Differential Equations (Nauka, Fizmatlit, Moscow, 1998) [in Russian].
L. R. Volevich and S. G. Gindikin, Newton’s Polyhedron Method in the Theory of Partial Differential Equations (Editorial URSS, Moscow, 2002) [in Russian].
A. G. Khovanskii, “Polyhedrons and algebra,” Tr. ISA Ross. Akad. Nauk 38, 23–35 (2008).
V. N. Nefedov, “A method of studying a polynomial for sign-definiteness in a positive orthant,” Tr. MAI: Mat., No. 22 (2006).
I. I. Eremin and N. N. Astaf’ev, Introduction to the Theory of Linear and Convex Programming (Nauka, Moscow, 1976) [in Russian].
A. Brønsted, Introduction to Convex Polytopes (Springer, Berlin, 1983; Mir, Moscow, 1988).
E. G. Belousov, Introduction to Convex Analysis and Integer Programming (MGU, Moscow, 1977) [in Russian].
C. A. Floudas, P. M. Pardalos, C. S. Adjimann, W. R. Esposito, Z. H. Gumus, S. T. Harding, and C. A. Schweiger, Handbook of Test Problems in Local and Global Optimization (Springer US, 1999). https://titan.princeton.edu/TestProblems/.
I.-B. Tjoa and L. T. Biegler, “Simultaneous solution and optimization strategies for parameter estimation of differential–algebraic equation systems,” Ind. Eng. Chem. Res. 30 (2), 376–385 (1991). https://doi.org/10.1021/ie00050a015
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The author declares that he has no conflicts of interest.
Additional information
Publisher’s Note.
Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Nefedov, V.N. Necessary and Sufficient Conditions for an Extremum in Complex Problems of Optimization of Systems Described by Polynomial and Analytic Functions. J. Comput. Syst. Sci. Int. 62, 179–200 (2023). https://doi.org/10.1134/S1064230723020156
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064230723020156