Constrained minimization methods
- 1 January 1966
- journal article
- Published by Elsevier in USSR Computational Mathematics and Mathematical Physics
- Vol. 6 (5) , 1-50
- https://doi.org/10.1016/0041-5553(66)90114-5
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A new method for solving conditioned maxima problemsJournal of Mathematical Analysis and Applications, 1965
- Mathematical programming by minimizing differentiable functionsNumerische Mathematik, 1964
- The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual MethodManagement Science, 1964
- Convex programming in Hilbert spaceBulletin of the American Mathematical Society, 1964
- On a successive approximation technique in solving some control system optimization problemsJournal of Mathematical Analysis and Applications, 1962
- A Steepest-Ascent Method for Solving Optimum Programming ProblemsJournal of Applied Mechanics, 1962
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear ConstraintsJournal of the Society for Industrial and Applied Mathematics, 1960
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956