Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization
- 1 September 1980
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 32 (1) , 1-16
- https://doi.org/10.1007/bf00934840
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A globally convergent method for nonlinear programmingJournal of Optimization Theory and Applications, 1977
- Dual Variable Metric Algorithms for Constrained OptimizationSIAM Journal on Control and Optimization, 1977
- A set of geometric programming test problems and their solutionsMathematical Programming, 1976
- Multiplier methods: A surveyAutomatica, 1976
- Combined Primal–Dual and Penalty Methods for Convex ProgrammingSIAM Journal on Control and Optimization, 1976
- An Ideal Penalty Function for Constrained OptimizationIMA Journal of Applied Mathematics, 1975
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper BoundsIMA Journal of Applied Mathematics, 1974
- On the Local and Superlinear Convergence of Quasi-Newton MethodsIMA Journal of Applied Mathematics, 1973
- Multiplier and gradient methodsJournal of Optimization Theory and Applications, 1969
- An Automatic Method for Finding the Greatest or Least Value of a FunctionThe Computer Journal, 1960