Проекція градієнта: спрощення області мінімізації афінним перетворенням

• Main Author: Spectorsky, Igor
• Format: Article
• Language: English
• Published: The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute" 2024
• Subjects: проекція градієнта; мінімізація; афінне перетворення
• Online Access: http://journal.iasa.kpi.ua/article/view/286064

One of the classical problems of optimization theory in a finite-dimensional space is to find a minimum of a function on a nonempty set. Usually, finding the precise solution to this task analytically requires a lot of computational resources or is even impossible at all. So, approximate methods are used most often in practical cases. One of the simplest and the most well-known among such approximate methods for unconditional optimization is the method of gradient descent; its generalization for conditional optimization was found in 1964, the method of projected gradient. For some simple sets (line segment, parallelepiped, ball), the projection of the point on the set can be easily found by an explicit formula. However, for more complicated sets (e.g., an ellipse), projecting becomes a separate task. Nevertheless, sometimes computing projection can be simplified by affine transform; e.g., an ellipse can be transformed into a ball by affine (moreover, by linear) transformation. The paper aims to simplify the problem of minimizing function on the set by changing the condition set by affine transform F(x)= Ax+b, where A is a non-degenerated square matrix, and b is a fixed vector of proper dimension.