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

DOI10.1007/BF00939631zbMATH Open0651.90068WikidataQ113108477 ScholiaQ113108477MaRDI QIDQ1106733FDOQ1106733

Authors: S. H. Smith 

Publication date: 1989

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

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

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)

Cites Work

• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Title not available (Why is that?)
• Function minimization by conjugate gradients
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
• A Newton-Raphson method for the solution of systems of equations
• Title not available (Why is that?)
• Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problem
• Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis

Cited In (12)

• Primal and dual formulations of sequential gradient-restoration algorithms for trajectory optimization problems
• Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
• Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• A method for hypothesis tests in polychotomous logistic regression
• 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)