A class of quadratically convergent algorithms for constrained function minimization
From MaRDI portal
Cites work
- A direct method for the general solution of a system of linear equations
- A Rapidly Convergent Descent Method for Minimization
- An Accelerated Gradient Projection Method for Linearly Constrained Nonlinear Estimation
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- Function minimization by conjugate gradients
- scientific article; zbMATH DE number 3327988 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- On variable-metric algorithms
- Projection methods for non-linear programming
- Quadratically convergent algorithms and one-dimensional search schemes
- Quasi-Newton Methods and their Application to Function Minimisation
- Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
- Unified approach to quadratically convergent algorithms for function minimization
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
Cited in
(4)- Ein lokal überlinear konvergentes Verfahren zur Bestimmung von Rückkehrpunkten implizit definierter Raumkurven
- Test example for nonlinear programming codes
- A geometric method in nonlinear programming
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
This page was built for publication: A class of quadratically convergent algorithms for constrained function minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1211414)
