Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods

DOI10.1007/BF00939631MaRDI QIDQ1106733zbMATH OpenWikidataFDO

Authors S. H. Smith

Publication date 1989

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

gradient projectionsteepest-descentsequential gradient-restoration algorithmgeneralized reduced gradient methodslinear equalities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)

Recommendations

• scientific article; zbMATH DE number 834483
• Solving constrained minimum‐time robot problems using the sequential gradient restoration algorithm
• Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis
• Primal and dual formulations of sequential gradient-restoration algorithms for trajectory optimization problems
• scientific article; zbMATH DE number 3944662

Cites work

• scientific article; zbMATH DE number 3885090 (Why is no real title available?)
• scientific article; zbMATH DE number 3912096 (Why is no real title available?)
• scientific article; zbMATH DE number 3781344 (Why is no real title available?)
• scientific article; zbMATH DE number 3562783 (Why is no real title available?)
• scientific article; zbMATH DE number 3793774 (Why is no real title available?)
• scientific article; zbMATH DE number 3302906 (Why is no real title available?)
• A Newton-Raphson method for the solution of systems of equations
• Function minimization by conjugate gradients
• Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problem
• Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis
• Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints

Cited in

(12)

• Primal and dual formulations of sequential gradient-restoration algorithms for trajectory optimization problems
• Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis
• Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
• A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations
• Primal-dual properties of sequential gradient-restoration algorithms for optimal control problems. II: General problem
• Inexact-restoration algorithm for constrained optimization
• A method for hypothesis tests in polychotomous logistic regression
• scientific article; zbMATH DE number 3944662 (Why is no real title available?)
• scientific article; zbMATH DE number 3954182 (Why is no real title available?)
• An interior-point method for solving box-constrained underdetermined nonlinear systems
• A flexible inexact-restoration method for constrained optimization
• Two-phase model algorithm with global convergence for nonlinear programming

This page was built for publication: Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106733)