Write a function to find the values of a design variable vector, x, that minimizes a scalar objective function, f, given a function handle to f, a starting guess, x0, subject to inequality and equality constraints with function handles g<=0 and h=0, respectively. Use a quadratic exterior penalty for the sequential unconstrained minimization technique (SUMT) with an optional input vector of penalty parameter values that become increasingly larger.