The following pages link to Garth P. McCormick (Q173850):
Displaying 40 items.
- Optimization with unary functions (Q811409) (← links)
- (Q1069446) (redirect page) (← links)
- The polyadic structure of factorable function tensors with applications to high-order minimization techniques (Q1069447) (← links)
- Second-order sensitivity analysis in factorable programming: Theory and applications (Q1104867) (← links)
- Implicitly defined optimization problems (Q1184525) (← links)
- Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
- Projection method for unconstrained optimization (Q2549170) (← links)
- Alternative proofs of the convergence properties of the conjugate- gradient method (Q2560770) (← links)
- Bounding Global Minima with Interval Arithmetic (Q3208450) (← links)
- (Q3314454) (← links)
- (Q3677502) (← links)
- Verification of High Order Optimality Conditions Using the Polyadic Representation of Derivatives (Q3774435) (← links)
- The Projective SUMT Method for Convex Programming (Q3830821) (← links)
- Locating an Isolated Global Minimizer of a Constrained Nonconvex Program (Q3885538) (← links)
- (Q3902844) (← links)
- Bounding Global Minima (Q3907417) (← links)
- (Q3915938) (← links)
- (Q3996571) (← links)
- An Arc Method for Nonlinear Programming (Q4105996) (← links)
- (Q4109499) (← links)
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems (Q4120313) (← links)
- A modification of Armijo's step-size rule for negative curvature (Q4145437) (← links)
- (Q4323616) (← links)
- (Q4401740) (← links)
- Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation (Q5516542) (← links)
- Second Order Conditions for Constrained Minima (Q5550819) (← links)
- The Sequential Unconstrained Minimization Technique (SUMT) Without Parameters (Q5557611) (← links)
- The Slacked Unconstrained Minimization Technique for Convex Programming (Q5574524) (← links)
- (Q5588268) (← links)
- (Q5589755) (← links)
- The Variable Reduction Method for Nonlinear Programming (Q5609872) (← links)
- (Q5623522) (← links)
- A Generalization of the Method of Balakrishnan: Inequality Constraints and Initial Conditions (Q5631691) (← links)
- (Q5639533) (← links)
- The Gradient Projection Method under Mild Differentiability Conditions (Q5647529) (← links)
- (Q5650216) (← links)
- Penalty function versus non-penalty function methods for constrained nonlinear programming problems (Q5653813) (← links)
- Methods of conjugate directions versus quasi-Newton methods (Q5661719) (← links)
- (Q5668629) (← links)
- Logarithmic SUMT limits in convex programming (Q5930727) (← links)
