Yuri G. Evtushenko

Yuri G. Evtushenko

Auto-generated profile, based on publicly available information

Yuri G. Evtushenko

Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, Moscow, Russia

Research Focus & Metrics

Academic Career Length

56Years (1971-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 1971 in USSR Computational Mathematics and Mathematical Physics
Verified
Journal Article
Closed access
YEYu.G. Evtushenko
Yu.G. Evtushenko

22 February 2012 in Optimization Letters
Verified
Journal Article
Closed access
PDF file
YEYury Evtushenko
Yury Evtushenko
Mikhail PosypkinMikhail Posypkin
Mikhail Posypkin

1 February 2009 in Computational Mathematics and Mathematical Physics
Verified
Journal Article
Closed access
PDF file
YEYu. G. Evtushenko
Yu. G. Evtushenko
VMV. U. Malkova
V. U. Malkova
ASA. A. Stanevichyus
A. A. Stanevichyus
On the basis of the method of nonuniform coverings, a parallel method for the global optimization of Lipschitzian functions is developed. This method is implemented in C-MPI for the global minimization of functions whose gradient satisfies the Lipschitz condition. The performance of the algorithm is demonstrated using the calculation of the structure of a protein molecule as an example.

15 May 2009 in Computer Science - Research and Development
Verified
Journal Article
Closed access
PDF file
YEYuri Evtushenko
Yuri Evtushenko
Mikhail PosypkinMikhail Posypkin
Mikhail Posypkin
ISIsrael Sigal
Israel Sigal

1 January 1998 in Optimization Methods and Software
Verified
Journal Article
Closed access
YEYuri Evtushenko
Yuri Evtushenko
A new and unified methodology for computing first order derivatives of functions obtained in complex multistep processes is developed on the basis of general expressions for differentiating a composite function. From these results, we derive the formulas for fap automatic differentiation of elementary functions, for gradients arising in optimal control problems, nonlinear programming and gradients arising in discretizations of processes governed by partial differential equations. In the proposed approach we start with a chosqn discretization scheme for the state equation and derive the exact gradient expression. Thus a unique discretization scheme is automatically generated for the adjoint equation For optimal control problems, the proposed computational formulas correspond to the integration of the adjoint system of equations that appears in Pontryagin's maximum principle. This technique appears to be very efficient, universal, and applicable to a wide variety of distributed controlled dynamic systems and to sensitivity analysis

28 November 2013 in Optimization Methods and Software
Verified
Journal Article
Closed access
YEYu.G. Evtushenko
Yu.G. Evtushenko
Mikhail PosypkinMikhail Posypkin
Mikhail Posypkin
The paper describes a method for solving multi-objective optimization problems with box constraints. Unlike existing approaches, the proposed method not only constructs a finite approximation of Pareto frontier, but also proves its ϵ-optimality. The paper gives a detailed explanation of basic theoretical concepts behind the method and describes the algorithmic implementation. A practically important application of the proposed method to finding the working space of a robotic manipulator is presented.