Garth P. McCormick

According to our database1, Garth P. McCormick authored at least 16 papers between 1967 and 2001.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2001
Logarithmic SUMT limits in convex programming.
Math. Program., 2001

1993
Calculation of bounds on variables satisfying nonlinear inequality constraints.
J. Glob. Optim., 1993

1992
Implicitly defined optimization problems.
Ann. Oper. Res., 1992

1991
Optimization with unary functions.
Math. Program., 1991

1989
The Projective SUMT Method for Convex Programming.
Math. Oper. Res., 1989

1988
Second-order sensitivity analysis in factorable programming: Theory and applications.
Math. Program., 1988

1987
Verification of High Order Optimality Conditions Using the Polyadic Representation of Derivatives.
Math. Oper. Res., 1987

1980
Locating an Isolated Global Minimizer of a Constrained Nonconvex Program.
Math. Oper. Res., 1980

1979
Bounding Global Minima with Interval Arithmetic.
Oper. Res., 1979

1977
A modification of Armijo's step-size rule for negative curvature.
Math. Program., 1977

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

Bounding Global Minima.
Math. Oper. Res., 1976

1972
Methods of conjugate directions versus quasi-Newton methods.
Math. Program., 1972

1971
Penalty function versus non-penalty function methods for constrained nonlinear programming problems.
Math. Program., 1971

1967
A Nonlinear Programming Model for Launch Vehicle Design and Costing.
Oper. Res., 1967

The Sequential Unconstrained Minimization Technique (SUMT) Without Parameters.
Oper. Res., 1967


  Loading...