原文描述如下:“The SCP algorithm needs to iteratively solve the convex subproblems, due to the linearization. Hence, we introduce the trust-region constraint to ensure the validity of the linearization within the trajectory's feasible region.” 然后在Successive Convexification for Real-Time Six-Degree...
Numerical simulations of a maximum-terminal-velocity entry trajectory optimization problem, which is not well solved by the basic sequential convex programming algorithm, are provided to demonstrate the effectiveness and performance of the newly proposed algorithms. The results show that optimal solutions ...
In this Lecture, several recent methods based on convex approximation schemes are discussed, that have demonstrated strong potential for efficient solution of structural optimization problems. First, the now well established “Approximation Concepts”...
This paper investigates the relation between sequential convex programming (SCP) as, e.g., defined in [24] and DC (difference of two convex functions) programming. We first present an SCP algorithm for solving nonlinear optimization problems with DC constraints and prove its convergence. Then we...
Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm Etoa JBE (2010) Solving convex quadratic bilevel programming prob- lems using an enumeration sequential quadratic programming algo- rithm. J Glob Optim 47:... JBE Etoa - 《Journal of Gl...
In response to the increasing demand for real-time optimization in aerospace systems, reduced space sequential convex programming (rSCP) has been developed to improve the computational efficiency of conventional sequential convex programming by explicitly eliminating state variables and state equations from ...
Third, the marginal likelihood maximization problem is a difference of convex programming problem. It is thus possible to find a locally optimal solution efficiently by using a majorization minimization algorithm and an interior point method where the cost of a single interior-point iteration grows ...
This paper presents a multiagent path planning algorithm based on sequential convex programming (SCP) that finds locally optimal trajectories. Previous work using SCP efficiently computes motion plans in convex spaces with no static obstacles. In many scenarios where the spaces are non-convex, previous...
A close-loop guidance and control using the proposed sequential convex programming scheme is then demonstrated by means of receding horizon to robustly drive the spacecraft maneuvering close to the target. Numerical simulations and results reveal that the proposed method provides rapid and reliable ...
Sequential Maximum Angle Convex Cone Sequential Minimal Optimization Sequential Minimization of Entropy Loss Sequential Modular Architecture for Robotics and Teleoperation Sequential monogamy Sequential monogamy Sequential Monte Carlo Template Class Sequential Monte-Carlo ...