Zobrazeno 1 - 10
of 51 603
pro vyhledávání: '"CONVEX programming"'
Autor:
Li, Yong1 (AUTHOR) ahsan.elahi@hrbeu.edu.cn, Zhu, Qidan1 (AUTHOR) llyy5927@hrbeu.edu.cn, Elahi, Ahsan1 (AUTHOR)
Publikováno v:
Algorithms. Jul2024, Vol. 17 Issue 7, p304. 19p.
Autor:
Zhang, Gejia, Mieth, Robert
The increasing demand for electricity and the aging infrastructure of power distribution systems have raised significant concerns about future system reliability. Failures in distribution systems, closely linked to system usage and environmental fact
Externí odkaz:
http://arxiv.org/abs/2410.14011
Convex programming plays a fundamental role in machine learning, data science, and engineering. Testing convexity structure in nonlinear programs relies on verifying the convexity of objectives and constraints. \citet{grant2006disciplined} introduced
Externí odkaz:
http://arxiv.org/abs/2407.05261
We introduce a GPU-accelerated Monte Carlo framework for nonconvex, free-final-time trajectory optimization problems. This framework makes use of the prox-linear method, which belongs to the larger family of sequential convex programming (SCP) algori
Externí odkaz:
http://arxiv.org/abs/2404.18034
In this paper, we consider the problem of minimum-time optimal control for a dynamical system with initial state uncertainties and propose a sequential convex programming (SCP) solution framework. We seek to minimize the expected terminal (mission) t
Externí odkaz:
http://arxiv.org/abs/2404.16269
Autor:
Oguri, Kenshiro
This paper presents a robust path-planning framework for safe spacecraft autonomy under uncertainty and develops a computationally tractable formulation based on convex programming. We utilize chance-constrained control to formulate the problem. It p
Externí odkaz:
http://arxiv.org/abs/2403.04062
Autor:
Chari, Govind M., Açıkmeşe, Behçet
We implement a fully factorization-free algorithm for nonconvex, free-final-time trajectory optimization. This algorithm is based on sequential convex programming and utilizes an inverse-free, exact discretization procedure to ensure dynamic feasibil
Externí odkaz:
http://arxiv.org/abs/2402.04561
Autor:
Wang, Boran
Alternating direction multiplication is a powerful technique for solving convex optimisation problems. When challenging subproblems are encountered in the real world, it is useful to solve them by introducing neighbourhood terms. When the neighbourho
Externí odkaz:
http://arxiv.org/abs/2404.17109
Optimizing the correlation properties of spreading codes is critical for minimizing inter-channel interference in satellite navigation systems. By improving the codes' correlation sidelobes, we can enhance navigation performance while minimizing the
Externí odkaz:
http://arxiv.org/abs/2404.12629