Quadratic termination properties of Davidon's new variable metric algorithm
From MaRDI portal
Publication:4184640
DOI10.1007/BF01593779zbMATH Open0399.90085OpenAlexW1994482884MaRDI QIDQ4184640FDOQ4184640
Authors: M. J. D. Powell
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01593779
Cites Work
- Optimally conditioned optimization algorithms without line searches
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- Quadratic Termination Properties of Minimization Algorithms I. Statement and Discussion of Results
- A minimal point of a finite metric set
Cited In (7)
- The kidney model as an inverse problem
- Differential optimization techniques
- Solving nonlinear inequalities in a finite number of iterations
- Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization
- A parallel unconstrained quasi-Newton algorithm and its performance on a local memory parallel computer
- A new arc algorithm for unconstrained optimization
- An algorithm for minimizing a differentiable function subject to box constraints and errors
This page was built for publication: Quadratic termination properties of Davidon's new variable metric algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4184640)