TEJ KUMAR

We revisit the method of direct Lagrange multiplier computation for design updates. We demonstrate various advantages of the direct method over the more popular bisection method. These include the absence of oscillations in the objective function, constant number of inner iterations for different Young's moduli and force values (as expected for a linear system), less number of iterations, and reduced computational time. We also show the applicability of the direct method to nonlinear constraints and variable separable multiple constraint problems. Replacements for the bisection method in popular MATLAB based topology optimization code is also provided.