x2=6 Shade the region above this line, since the second inequality isn't satisfied there. Lastly, plot the line 3x1+2x2 = 18 Shade the region where inequality 3 is not satisfied. You should now have a ...

The φ-divergence proximal method is an extension of the proximal minimization algorithm, where the usual quadratic proximal term is substituted by a class of convex statistical distances, called ...

The trust-region-based sequential convex programming (TSCP) method is designed to solve the nonlinear trajectory planning problem using successive linearization and trust region. The TSCP method has a ...