A second-order continuous gradient-projection method with a variable metric
From MaRDI portal
The paper is devoted to the construction of a new modification of the gradient-projection method for solving the minimization problem. A second-order continuous gradient-projection method with a variable metric is proposed for solving a problem in convex programming, and its convergence is examined. A regularized variant of the method is considered for the case when the goal function or the admissible set are prescribed inaccurately.
Recommendations
- On a variant of the continuous second-order gradient projection method and its discrete analogue
- A version of continuous projection method of the second order with variable metric.
- scientific article; zbMATH DE number 5288608
- A regularized continuous projection minimization method of the second order with a variable metric
- scientific article; zbMATH DE number 5225113
Cited in
(9)- Continuous algorithms for solving convex constrained minimization problems using projection onto the admissible set
- On a variant of the continuous second-order gradient projection method and its discrete analogue
- scientific article; zbMATH DE number 2187217 (Why is no real title available?)
- Fast Curvature Matrix-Vector Products for Second-Order Gradient Descent
- A version of continuous projection method of the second order with variable metric.
- scientific article; zbMATH DE number 4025176 (Why is no real title available?)
- scientific article; zbMATH DE number 6319012 (Why is no real title available?)
- scientific article; zbMATH DE number 5270701 (Why is no real title available?)
- Continuous second order minimization method with variable metric projection operator
This page was built for publication: A second-order continuous gradient-projection method with a variable metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569379)
