An Iterative Method for Finding Stationary Values of a Function of Several Variables

DOI10.1093/comjnl/5.2.147zbMath0104.34303OpenAlexW2070473094MaRDI QIDQ3289317

M. J. D. Powell

Publication date: 1962

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/5.2.147

zbMATH Keywords

numerical analysis

Related Items

A direct search package for unconstrained minimization, A new algorithm for nonlinear least squares, Superlinearly convergent trust-region method without the assumption of positive-definite Hessian, Global convergence and the Powell singular function, An interior point algorithm for nonlinear quantile regression, Some research on Levenberg-Marquardt method for the nonlinear equations, Parallel tangents and steepest descent optimization algorithm-a computer implementation with application to linear, partially linear models and qualitative data^†, Laguerre functions in signal analysis and parameter identification, Least squares model reduction using step response, Asymmetric minimization with a convex fourth degree approximation, Optimally conditioned optimization algorithms without line searches, A new approach based on the Newton's method to solve systems of nonlinear equations, A trust region method for optimization problem with singular solutions, Risoluzione di un sistema di equazioni non lineari con metodo numerico ai minimi quadrati, Risoluzione di un sistema di equazioni non lineari con metodo numerico ai minimi quadrati, Numerical algorithms for nonlinear \(L_p\)-norm problem and its extreme case, Supermemory descent methods for unconstrained minimization, Solving the nonlinear least square problem: Application of a general method, Numerical experiments on DFP-method, a powerful function minimization technique, On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption, An assessment of two approaches to variable metric methods, A robust conjugate-gradient algorithm which minimizes L-functions, A conjugate direction algorithm without line searches, Approximation methods for the unconstrained optimization, Unified approach to unconstrained minimization via basic matrix factorizations, Nonlinear programming on a microcomputer, A new arc algorithm for unconstrained optimization, A modified Broyden-like quasi-Newton method for nonlinear equations, On the time optimal course changing of ships, Computational experience with Davidon's least-square algorithm, On variable-metric algorithms, A computational technique for finding 'bang-bang' controls of non-linear time-varying systems, New approach to comparison of search methods used in nonlinear programming problems, Benchmarking results for the Newton-Anderson method, A Quasi-Newton Method with No Derivatives, Secant relations versus positive definiteness in quasi-Newton methods, A simple Marquardt algorithm for the nonlinear least-squares problem, Orthogonality correction in the conjugate-gradient method, On the convergence of a process basing on the modified secant method, A two-phase optimization procedure for integer programming problems