A class of quadratically convergent algorithms for constrained function minimization
From MaRDI portal
Publication:1211414
DOI10.1007/BF00933853zbMath0291.90061OpenAlexW2077344004MaRDI QIDQ1211414
Publication date: 1975
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00933853
Related Items
Ein lokal überlinear konvergentes Verfahren zur Bestimmung von Rückkehrpunkten implizit definierter Raumkurven, An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints, Test example for nonlinear programming codes, A geometric method in nonlinear programming
Cites Work
- A direct method for the general solution of a system of linear equations
- Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
- Unified approach to quadratically convergent algorithms for function minimization
- On variable-metric algorithms
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- Quadratically convergent algorithms and one-dimensional search schemes
- Projection methods for non-linear programming
- A Rapidly Convergent Descent Method for Minimization
- Function minimization by conjugate gradients
- Quasi-Newton Methods and their Application to Function Minimisation
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- An Accelerated Gradient Projection Method for Linearly Constrained Nonlinear Estimation
- Methods of conjugate gradients for solving linear systems
- Unnamed Item
