Continuous trajectory planning for non-convex utility functions using hybrid optimization

DOI10.1016/J.EJCON.2025.101425MaRDI QIDQ6869297zbMATH OpenFDO

Authors He Hao, Daniel A. M. M. Silvestre, Carlos Silvestre

Publication date 22 January 2026

Published in European Journal of Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJCON.2025.101425

zbMATH Keywords

hybrid methodnonconvex functionsmooth trajectory

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Geometric methods (93B27) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Cites work

• Adaptive subgradient methods for online learning and stochastic optimization
• Conditions for linear convergence of the gradient method for non-convex optimization
• Constrained model predictive control: Stability and optimality
• Distributed region following and perimeter surveillance tasks in star-shaped sets
• Introductory lectures on convex optimization. A basic course.
• Local minima structures in Gaussian mixture models
• Resource-aware cooperative level surface tracking control in 3D time-varying scalar field
• Restart of Accelerated First-Order Methods With Linear Convergence Under a Quadratic Functional Growth Condition
• Revisiting Normalized Gradient Descent: Fast Evasion of Saddle Points
• Some methods of speeding up the convergence of iteration methods
• Stochastic primal-dual hybrid gradient algorithm with adaptive step sizes

This page was built for publication: Continuous trajectory planning for non-convex utility functions using hybrid optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6869297)