Problem 523. Sequential Unconstrained Minimization (SUMT) using Exterior Penalty

Created by Robert Canfield

Solve Later

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.

Solve

Solution Stats

34 Solutions
11 Solvers

Last Solution submitted on Jun 19, 2020

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Rafael S.T. Vieira on 19 Jun 2020 at 2:28

Please, be aware that test cases don't necessarily use all the same penalty parameters. For instance, I have used 1e6 for cases 2,3,4 & 6 and 1e4 for cases 1 & 5. It all depends on which method one uses for the exterior penalty (and approximations may fail because of it).

Rafael S.T. Vieira on 19 Jun 2020 at 2:33

In a sense, it is like trying to find the secret formula instead of finding the minimum value of a function.

Problem Recent Solvers11

Problem Tags

aoe4084 constrained minimization

Problem 523. Sequential Unconstrained Minimization (SUMT) using Exterior Penalty

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers11

Suggested Problems

More from this Author17

Problem Tags

Problem 523. Sequential Unconstrained Minimization (SUMT) using Exterior Penalty

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers11

Suggested Problems

More from this Author17

Problem Tags

Players