This paper extends the Sequential Unconstrained Minimization Technique for nonlinear programming to include problems where the constraints are a mixture of inequalities and equalities. Theorems indicating the dual nature of the method and the solution of a subproblem are given. Finally, the theoretical basis for a k-point extrapolation procedure is established.
No takes yet. Share an insight, caveat, or question.
Fiacco et al. (1966) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: