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 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 ...

This paper provides a theoretical foundation for efficient interior-point algorithms for convex programming problems expressed in conic form, when the cone and its associated barrier are self-scaled.

An algorithm is described for the solution of nonseparable convex optimization problems. This method utilizes iterative piecewise-linear approximation of the nonseparable objective function, but ...