please help me get started with this problem code.
or just write the code. Also give me some link for cvx tutorials.
The objective of Golinski’s Speed Reducer problem is to find the minimum of a gear box volume f (and, hence, its minimum weight), subject to several constraints. There are seven design variables, x1 - x7 , which represent

x1

width of the gear face, cm

x2

teeth module, cm

x3

number of pinion teeth

x4

shaft 1 length between bearings, cm

x5

shaft 2 length between bearings, cm

x6

diameter of shaft 1, cm

x7

diameter of shaft 2, cm

Mathematically, the problem is specified as follows:

The terms in which the coefficient multiplying the variable powers are negative are not valid monomials, and therefore, this is not a valid generalized geometric program.

I think the only non-convexity is in the objective function. I believe the constraints have no more than one negative coefficient “monomial”, which can be moved to the RHS as a true monomial and be compliant with CVX’s Geometric Programming (gp) rules.