A probe about the unified construction of gradient projection type methods
The problem of minimizing a continuously differentiable objective function \(f(x)\) under inequality constraints \(g_ j(x)\leq 0\) \((j=1,\dots,m)\), where \(x\in E^ n\) and the \(g_ j\)'s are continuously differentiable is considered. It is shown that the iterative directions of many well-known gradient projection type methods at an arbitrary point can be obtained through solving a linear system constructed on the basis of the original optimization problem. Further, some new gradient projection type algorithms can be derived using this linear system.
- scientific article; zbMATH DE number 818543
- scientific article; zbMATH DE number 270211
- scientific article; zbMATH DE number 4043629
- scientific article; zbMATH DE number 4202043
- On the convergence of the continuous gradient projection method
- Refinements of some convergence results of the gradient-projection algorithm
- Publication:3489371
- Gradient-type projection methods for quasi-variational inequalities
- On the convergence of the projected gradient method
- scientific article; zbMATH DE number 4039647
This page was built for publication: A probe about the unified construction of gradient projection type methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1210243)
