Computational experience with quadratically convergent minimisation methods

DOI10.1093/comjnl/13.2.185zbMath0202.16303OpenAlexW2006041360MaRDI QIDQ5599395

R. W. H. Sargent, Bruce A. Murtagh

Publication date: 1970

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

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

Related Items

Conjugate gradient algorithms in nonlinear structural analysis problems, Recent advances in unconstrained optimization, An algorithm for solving linearly constrained optimization problems, Quasi Newton techniques generate identical points II: The proofs of four new theorems, Technological change and disposability of inputs, Projection methods for non-linear programming, Specialised versus general-purpose algorithms for minimising functions that are sums of squared terms, A dimer-type saddle search algorithm with preconditioning and linesearch, Numerical experiments on DFP-method, a powerful function minimization technique, Approximation methods for the unconstrained optimization, An algorithm for minimizing a differentiable function subject to box constraints and errors, Some remarks on the symmetric rank-one update, On the convergence of sequential minimization algorithms, Respecifying the weighting matrix of a quadratic objective function, A computational study of active set strategies in nonlinear programming with linear constraints, An algorithm that minimizes homogeneous functions of \(n\) variables in \(n + 2\) iterations and rapidly minimizes general functions, A pseudo Newton-Raphson method for function minimization, Unconstrained approach to the extremization of constrained functions, Quadratically convergent algorithms and one-dimensional search schemes, Stability of Huang's update for the conjugate gradient method, Method of dual matrices for function minimization, Unnamed Item