Real time trajectory planning is vital in rocket precision powered landing guidance. Due to the nonconvex angle of attack (AOA) constraint and other constraints, including nonlinear dynamics and ...

This paper revisits the well-known family of sequential convex programming methods. We adopt the difference of convex programming technique to relax a wide variety of nonconvex optimization problems ...

In this paper we consider min-max convex semi-infinite programming. To solve these problems we introduce a unified framework concerning Remez-type algorithms and integral methods coupled with penalty ...

Programming theory is treated initially without any assumptions about the functions and with interpretation for production and activity analysis. By proof of a general theorem about optimal and ...

Based on rules of disciplined convex programming, we can (sometimes) easily check whether our problem is convex or not. Moreover, we can model a convex problem with elaborated constraints on a ...

Generic challenges involving convex optimization, especially the challenge of determining whether or not a given model is convex. See the FAQ. Difficulties caused by the strictness imposed by the ...

Convex optimization, prized for its efficiency and utility in solving small and medium-size problems across multiple disciplines, could soon be extended to handle much larger problems and tasks, such ...