A generalization of the gradient projection method to extremal problems with preconvex constraints.
From MaRDI portal
Publication:1395322
zbMath1114.90466MaRDI QIDQ1395322
V. I. Zabotin, Yuri A. Chernyaev
Publication date: 1 July 2003
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Related Items (5)
Unnamed Item ⋮ A relaxation method for minimizing a smooth function on a generalized spherical segment ⋮ An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface ⋮ Numerical algorithm for minimizing a convex function on the intersection of a smooth surface and a convex compact set ⋮ Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set
This page was built for publication: A generalization of the gradient projection method to extremal problems with preconvex constraints.
