Showing 2019 · math.OCShow all
2 papers · 2 filters
math.OC2019
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…
math.OC2019
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…