Maximizing a Function in a Convex Region
Data up to Jan 2025
Total Citations Per Year
Abstract
References (18)
Methods of conjugate gradients for solving linear systems
1952 • 7,639 citations
An algorithm for quadratic programming
1956 • 2,939 citations
Activity Analysis of Production and Allocation
1952 • 1,485 citations
Nonlinear Programming
1951 • 1,127 citations
On Minimizing a Convex Function Subject to Linear Inequalities
1955 • 603 citations
The generalized simplex method for minimizing a linear form under linear inequality restraints
1955 • 562 citations
The optimization of a quadratic function subject to linear constraints
1956 • 534 citations
The Simplex Method for Quadratic Programming
1960 • 518 citations
The Simplex Method for Quadratic Programming
1959 • 502 citations
A quadratic programming procedure
1957 • 365 citations
The dual method of solving the linear programming problem
1954 • 236 citations
Mathematical Programming and Electrical Networks
1960 • 153 citations
Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
1955 • 142 citations
7* A Primal-Dual Algorithm for Linear Programs
1957 • 102 citations
Minimization of non‐linear separable convex functionals
1954 • 98 citations
The dual simplex algorithm for bounded variables
1958 • 50 citations
Nonlinear Power of Adjacent Extreme Point Methods in Linear Programming
1957 • 44 citations
Deleted Work
1955 • 0 citations