The Sequential Unconstrained Minimization Technique (SUMT) Without Parameters
From MaRDI portal
Publication:5557611
DOI10.1287/OPRE.15.5.820zbMath0171.17905OpenAlexW2068800669MaRDI QIDQ5557611
Garth P. McCormick, Anthony V. Fiacco
Publication date: 1967
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.15.5.820
Related Items (9)
Reconstruction of contact pressures between flexible objects and rigid planes using friction data ⋮ Probability maximization via Minkowski functionals: convex representations and tractable resolution ⋮ Penalty function versus non-penalty function methods for constrained nonlinear programming problems ⋮ A language for nonlinear programming problems ⋮ A barrier function method for minimax problems ⋮ Rates of convergence for a method of centers algorithm ⋮ An exact penalty function algorithm for solving general constrained parameter optimization problems ⋮ Penalty methods for mathematical programming in \(E^n\) with general constraint sets ⋮ A column generation algorithm for nonlinear programming
This page was built for publication: The Sequential Unconstrained Minimization Technique (SUMT) Without Parameters
