An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface

DOI10.1134/S0965542515090079zbMath1330.49027OpenAlexW1913881827MaRDI QIDQ901844

N. E. Zubov

Publication date: 6 January 2016

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

Full work available at URL: https://doi.org/10.1134/s0965542515090079

zbMATH Keywords

local minimumNewton's methodgradient projection methodsmooth surface

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Newton-type methods (49M15)

Related Items (7)

Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface ⋮ Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds ⋮ 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 ⋮ Iterative algorithm for minimizing a convex function at the intersection of a spherical surface and a convex compact set ⋮ 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 ⋮ Newton's method for minimizing a convex twice differentiable function on a preconvex 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

Cites Work

• Unnamed Item
• 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
• Algorithms for projecting a point onto a level surface of a continuous function on a compact set
• A generalization of the gradient projection method to extremal problems with preconvex constraints.
• Два алгоритма отыскания проекции точки на невыпуклое множество в нормированном пространстве
• A relaxation method for minimizing a smooth function on a generalized spherical segment
• Two modifications of the linearization method in non-linear programming
• 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
• Modified Lagrange functions in non-linear programming

This page was built for publication: An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface