Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods
From MaRDI portal
Publication:1106733
DOI10.1007/BF00939631zbMath0651.90068WikidataQ113108477 ScholiaQ113108477MaRDI QIDQ1106733
Publication date: 1989
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
gradient projectionsteepest-descentsequential gradient-restoration algorithmgeneralized reduced gradient methodslinear equalities
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)
Related Items
Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis, A method for hypothesis tests in polychotomous logistic regression, Two-phase model algorithm with global convergence for nonlinear programming, Inexact-restoration algorithm for constrained optimization, An interior-point method for solving box-constrained underdetermined nonlinear systems, A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations, Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming., A flexible inexact-restoration method for constrained optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis
- A Newton-Raphson method for the solution of systems of equations
- Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
- Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problem
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Function minimization by conjugate gradients
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints