Newton's method for optimization problems with a convex smooth surface as a constraint

zbMATH Open1249.90325MaRDI QIDQ2901142FDOQ2901142

Authors: Yu. A. Chernyaev 

Publication date: 16 July 2012

Published in: Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 2208686
• An iterative method for minimizing a convex nonsmooth function on a convex smooth surface
• An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface
• Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface
• Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set

zbMATH Keywords

convergence of algorithmNewton's methodsecond derivative matrixtangential hyperplaneconvex smooth surfacelocal minimum conditions

Mathematics Subject Classification ID

Methods of quasi-Newton type (90C53)

Cited In (6)

• An iterative method for minimizing a convex nonsmooth function on a convex smooth surface
• Newton's method and its use in optimization
• A Newton-bracketing method for a simple conic optimization problem
• Title not available (Why is that?)
• An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface
• Title not available (Why is that?)

This page was built for publication: Newton's method for optimization problems with a convex smooth surface as a constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901142)