Penalty function versus non-penalty function methods for constrained nonlinear programming problems
- 1 December 1971
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 1 (1) , 217-238
- https://doi.org/10.1007/bf01584087
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Methodes Duales pour le Calcul du Minimum d'une Fonction Convexe sur une Intersection de ConvexesPublished by Springer Nature ,1970
- An Exact Potential Method for Constrained MaximaSIAM Journal on Numerical Analysis, 1969
- Optimization by Least SquaresSIAM Journal on Numerical Analysis, 1968
- Generalized Polynomial OptimizationSIAM Journal on Applied Mathematics, 1967
- Lagrange multipliers and nonlinear programmingJournal of Mathematical Analysis and Applications, 1967
- A Ricocheting Gradient Method for Nonlinear OptimizationSIAM Journal on Applied Mathematics, 1966
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear ConstraintsJournal of the Society for Industrial and Applied Mathematics, 1961
- `` Direct Search'' Solution of Numerical and Statistical ProblemsJournal of the ACM, 1961
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959