20 citations · 20 across the 4 of their papers we have counts for
5 papers
Mixed robustness: Analysis of systems with uncertain deterministic and random parameters using the example of linear systems
Andrey Tremba
Robustness of linear systems with constant coefficients is considered. There exist methods and tools for analyzing the stability of systems with random or deterministic uncertainti…
Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds
Maxim Balashov, Andrey Tremba
We analyse the convergence of the gradient projection algorithm, which is finalized with the Newton method, to a stationary point for the problem of nonconvex constrained optimizat…
Sparse solutions of optimal control via Newton method for under-determined systems
Boris Polyak, Andrey Tremba
We focus on finding sparse and least--norm solutions for unconstrained nonlinear optimal control problems. Such optimization problems are non-convex and non-smooth, neverth…
Gradient projection and conditional gradient methods for constrained nonconvex minimization
Maxim Balashov, Boris Polyak, Andrey Tremba
Minimization of a smooth function on a sphere or, more generally, on a smooth manifold, is the simplest non-convex optimization problem. It has a lot of applications. Our goal is t…
New versions of Newton method: step-size choice, convergence domain and under-determined equations
Boris Polyak, Andrey Tremba
Newton method is one of the most powerful methods for finding solutions of nonlinear equations and for proving their existence. In its "pure" form it has fast convergence near the…