The Sequential Unconstrained Minimization Technique (SUMT) Without Parameters. - Anthony V. Fiacco; Garth P. McCormick (Oper. Res., 1967)

A Nonlinear Programming Model for Launch Vehicle Design and Costing. - Benjamin C. Rush; Jerome Bracken; Garth P. McCormick (Oper. Res., 1967)

Penalty function versus non-penalty function methods for constrained nonlinear programming problems. - Garth P. McCormick (Math. Program., 1971)

Methods of conjugate directions versus quasi-Newton methods. - Garth P. McCormick; Klaus Ritter (Math. Program., 1972)

Bounding Global Minima. - Louis J. Mancini; Garth P. McCormick (Math. Oper. Res., 1976)

Computability of global solutions to factorable nonconvex programs: Part I - Convex underestimating problems. - Garth P. McCormick (Math. Program., 1976)

A modification of Armijo's step-size rule for negative curvature. - Garth P. McCormick (Math. Program., 1977)

Bounding Global Minima with Interval Arithmetic. - Louis J. Mancini; Garth P. McCormick (Oper. Res., 1979)

Locating an Isolated Global Minimizer of a Constrained Nonconvex Program. - Garth P. McCormick (Math. Oper. Res., 1980)

Verification of High Order Optimality Conditions Using the Polyadic Representation of Derivatives. - Garth P. McCormick (Math. Oper. Res., 1987)

Second-order sensitivity analysis in factorable programming: Theory and applications. - Richard H. F. Jackson; Garth P. McCormick (Math. Program., 1988)

The Projective SUMT Method for Convex Programming. - Garth P. McCormick (Math. Oper. Res., 1989)

Optimization with unary functions. - Garth P. McCormick; Ariela Sofer (Math. Program., 1991)

Implicitly defined optimization problems. - Anura H. deSilva; Garth P. McCormick (Ann. Oper. Res., 1992)

Calculation of bounds on variables satisfying nonlinear inequality constraints. - Ammar Salah El-Deen Hamed; Garth P. McCormick (J. Glob. Optim., 1993)

Logarithmic SUMT limits in convex programming. - Garth P. McCormick; Christoph Witzgall (Math. Program., 2001)