Garth P. McCormick

From MaRDI portal
Person:173850

Available identifiers

zbMath Open mccormick.garth-philipMaRDI QIDQ173850

List of research outcomes





PublicationDate of PublicationType
Logarithmic SUMT limits in convex programming2002-05-22Paper
https://portal.mardi4nfdi.de/entity/Q43236161995-02-23Paper
Calculation of bounds on variables satisfying nonlinear inequality constraints1993-05-04Paper
https://portal.mardi4nfdi.de/entity/Q39965711992-09-17Paper
Implicitly defined optimization problems1992-06-28Paper
Optimization with unary functions1991-01-01Paper
The Projective SUMT Method for Convex Programming1989-01-01Paper
Second-order sensitivity analysis in factorable programming: Theory and applications1988-01-01Paper
Verification of High Order Optimality Conditions Using the Polyadic Representation of Derivatives1987-01-01Paper
The polyadic structure of factorable function tensors with applications to high-order minimization techniques1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36775021983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33144541981-01-01Paper
Locating an Isolated Global Minimizer of a Constrained Nonconvex Program1980-01-01Paper
Bounding Global Minima with Interval Arithmetic1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39028441979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39159381978-01-01Paper
A modification of Armijo's step-size rule for negative curvature1977-01-01Paper
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41094991976-01-01Paper
Bounding Global Minima1976-01-01Paper
An Arc Method for Nonlinear Programming1975-01-01Paper
Alternative proofs of the convergence properties of the conjugate- gradient method1974-01-01Paper
The Gradient Projection Method under Mild Differentiability Conditions1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44017401972-01-01Paper
Methods of conjugate directions versus quasi-Newton methods1972-01-01Paper
Projection method for unconstrained optimization1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56502161972-01-01Paper
Penalty function versus non-penalty function methods for constrained nonlinear programming problems1971-01-01Paper
The Variable Reduction Method for Nonlinear Programming1970-01-01Paper
A Generalization of the Method of Balakrishnan: Inequality Constraints and Initial Conditions1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56395331970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56686291969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56235221969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55882681968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55897551968-01-01Paper
Second Order Conditions for Constrained Minima1967-01-01Paper
The Slacked Unconstrained Minimization Technique for Convex Programming1967-01-01Paper
The Sequential Unconstrained Minimization Technique (SUMT) Without Parameters1967-01-01Paper
Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation1966-01-01Paper

Research outcomes over time

This page was built for person: Garth P. McCormick