Cody

Problem 524. Sequential Unconstrained Minimization (SUMT) using Interior Penalty

Created by Robert Canfield in Community

Write a function to find the values of a design variable vector, x, that minimizes a scalar objective function, f ( x ), given a function handle to f, and a starting guess, x0, subject to inequality constraints g ( x )<=0 with function handle g. Use a logarithmic interior penalty for the sequential unconstrained minimization technique (SUMT) with an optional input vector of increasing penalty parameter values. That is, the penalty (barrier) function, P, is

 P(x,r) = -sum(log(-g(x)))/r

where r is the penalty parameter.

Solution Stats

43.75% Correct | 56.25% Incorrect
Last solution submitted on Dec 25, 2018

Recent Solvers5

Suggested Problems

More from this Author17

Discover MakerZone

MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn more

Discover what MATLAB® can do for your career.

Opportunities for recent engineering grads.

Apply Today

MATLAB Academy

New to MATLAB?

Learn MATLAB today!