Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set

DOI10.1134/S0965542519010056zbMath1431.90147WikidataQ127871262 ScholiaQ127871262MaRDI QIDQ2314191

Yanyan Li

Publication date: 19 July 2019

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

gradient projection methodconvex closed setsmooth surfaceconvergence of the algorithmnecessary condition for a local minimum

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (4)

Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface ⋮ Conditional gradient method for optimization problems with a constraint in the form of the intersection of a convex smooth surface and a convex compact set ⋮ Numerical algorithm for solving a class of optimization problems with a constraint in the form of a subset of points of a smooth surface ⋮ Numerical algorithm for minimizing a convex function on the intersection of a smooth surface and a convex compact set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of the gradient projection method and Newton's method as applied to optimization problems constrained by intersection of a spherical surface and a convex closed set
• An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface
• A generalization of the gradient projection method to extremal problems with preconvex constraints.
• Dual barrier-projection and barrier-Newton methods for linear programming problems.
• A version of the regularized gradient projection method
• On three-step regularized method of gradient projection for solving of minimization problems with inaccurrate initial data
• Barrier-projective methods for nonlinear programming
• On convergence rate estimation for gradient projection method
• Gradient projection method for stable approximation of quasisolutions to irregular nonlinear operator equations

This page was built for publication: Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set