Computational experience with quadratically convergent minimisation methods
From MaRDI portal
Cited in
(22)- Conjugate gradient algorithms in nonlinear structural analysis problems
- 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
- Respecifying the weighting matrix of a quadratic objective function
- 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
- scientific article; zbMATH DE number 4068146 (Why is no real title available?)
- 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 computational study of active set strategies in nonlinear programming with linear constraints
- 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
- A dimer-type saddle search algorithm with preconditioning and linesearch
- On the convergence of sequential minimization algorithms
This page was built for publication: Computational experience with quadratically convergent minimisation methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5599395)
