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

DOI10.1134/S0965542516100055zbMath1394.90557MaRDI QIDQ506226

Yong-Cai Geng, Sumit K. Garg

Publication date: 31 January 2017

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

zbMATH Keywords

Newton's methodgradient projection methodconvergence of an algorithmconvex closed setnecessary conditions for a local minimumspherical surface

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53) Methods of reduced gradient type (90C52)

Related Items (5)

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 ⋮ Newton's method for minimizing a convex twice differentiable function on a preconvex set ⋮ Search for periodic solutions of highly nonlinear dynamical systems ⋮ Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalization of the Newton method for one class of nonconvex mathematical programming problems
• An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface
• On regularization of Newton's method when the initial data is imprecise
• A two-step linearization method for minimization problems.
• A version of the regularized gradient projection method
• Three-step method of gradient projection for minimization problems
• Prognostic-type iterative methods for calculation of fixed points of extremal mappings
• A relaxation method for minimizing a smooth function on a generalized spherical segment
• Two modifications of the linearization method in non-linear programming
• The method of feasible directions for mathematical programming problems with preconvex constraints
• Acceleration of the convergence of the linearization method for the constrained minimization problem
• Iterative methods for solving non-linear programming problems, using modified Lagrange functions
• A method of evaluating the stationary points of a general problem of non-linear programming
• An iterative regularization of Newton's method
• Modified Lagrange functions in non-linear programming

This page was built for publication: 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