Zobrazeno 1 - 10
of 110
pro vyhledávání: '"Kaya, C. Yalçın"'
We study the problem of finding curves of minimum pointwise-maximum arc-length derivative of curvature, here simply called curves of minimax spirality, among planar curves of fixed length with prescribed endpoints and tangents at the endpoints. We co
Externí odkaz:
http://arxiv.org/abs/2409.08644
We consider the problem of finding curves of minimum pointwise-maximum curvature, i.e., curves of minimax curvature, among planar curves of fixed length with prescribed endpoints and tangents at the endpoints. We reformulate the problem in terms of o
Externí odkaz:
http://arxiv.org/abs/2404.12574
Riemannian cubics in tension are critical points of the linear combination of two objective functionals, namely the squared norms of the velocity and acceleration of a curve on a Riemannian manifold. We view this variational problem of finding a curv
Externí odkaz:
http://arxiv.org/abs/2306.15180
Publikováno v:
Pure and Applied Functional Analysis, Volume 8, Number 5, 2023
We propose a primal--dual technique that applies to infinite dimensional equality constrained problems, in particular those arising from optimal control. As an application of our general framework, we solve a control-constrained double integrator opt
Externí odkaz:
http://arxiv.org/abs/2304.03465
We explore the relationship between the dual of a weighted minimum-energy control problem, a special case of linear-quadratic optimal control problems, and the Douglas-Rachford (DR) algorithm. We obtain an expression for the fixed point of the DR ope
Externí odkaz:
http://arxiv.org/abs/2303.06527
Autor:
Kaya, C. Yalçın, Maurer, Helmut
Simultaneous optimization of multiple objective functions results in a set of trade-off, or Pareto, solutions. Choosing a, in some sense, best solution in this set is in general a challenging task: In the case of three or more objectives the Pareto f
Externí odkaz:
http://arxiv.org/abs/2301.13327
Splitting and projection-type algorithms have been applied to many optimization problems due to their simplicity and efficiency, but the application of these algorithms to optimal control is less common. In this paper we utilize the Douglas--Rachford
Externí odkaz:
http://arxiv.org/abs/2210.17279
Autor:
Burachik, Regina S., Caldwell, Bethany I., Kaya, C. Yalçın, Moursi, Walaa M., Saurette, Matthew
The Douglas-Rachford and Peaceman-Rachford algorithms have been successfully employed to solve convex optimization problems, or more generally find zeros of monotone inclusions. Recently, the behaviour of these methods in the inconsistent case, i.e.,
Externí odkaz:
http://arxiv.org/abs/2201.06661
It is well known that the Newton method may not converge when the initial guess does not belong to a specific quadratic convergence region. We propose a family of new variants of the Newton method with the potential advantage of having a larger conve
Externí odkaz:
http://arxiv.org/abs/2103.14774
Autor:
Kaya, C. Yalçın
Publikováno v:
Optimization, 2021
This paper is concerned with finding an optimal path for an observer, or sensor, moving at a constant speed, which is to estimate the position of a stationary target, using only bearing angle measurements. The generated path is optimal in the sense t
Externí odkaz:
http://arxiv.org/abs/2103.02059