Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis
[For part I see Zbl 0651.90068.] The convergent properties of the SGRA for the general case of nonlinear constraints are analyzed. It is shown that, for analytical convergence purposes, the feasibility restoration phase plays a crucial role. A slight modification of the original restoration algorithm is proposed, and global convergence of the modified version is proven. Finally, a slightly modified version of the complete algorithm is presented and global convergence is proven. The asymptotic rate of convergence of the SGRA is also analyzed. The reader is assumed to be familiar with the problem statement and the description of the SGRA, presented in Part I.
- Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods
- scientific article; zbMATH DE number 834483
- Periodically preconditioned conjugate gradient-restoration algorithm
- Two-phase model algorithm with global convergence for nonlinear programming
- scientific article; zbMATH DE number 3936943
- A Newton-Raphson method for the solution of systems of equations
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 3562346 (Why is no real title available?)
- scientific article; zbMATH DE number 3641625 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Minimization of functions having Lipschitz continuous first partial derivatives
- Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problem
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- On Steepest Descent
- On the asymptotic directions of the s-dimensional optimum gradient method
- On the Use of Approximations in Algorithms for Optimization Problems with Equality and Inequality Constraints
- Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods
- Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
- The Gradient Projection Method Along Geodesics
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- Global optimization of higher order moments in portfolio selection
- Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods
- Two-phase model algorithm with global convergence for nonlinear programming
- An interior-point method for solving box-constrained underdetermined nonlinear systems
- Inexact-restoration algorithm for constrained optimization
- A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations
- A flexible inexact-restoration method for constrained optimization
- scientific article; zbMATH DE number 834483 (Why is no real title available?)
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
This page was built for publication: Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106734)
