Generalization of the Newton method for one class of nonconvex mathematical programming problems

MaRDI QIDQ462571zbMATH OpenFDO

Authors Yu. A. Chernyaev

Publication date 21 October 2014

Published in Russian Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53)

Recommendations

• Newton's method for minimizing a convex twice differentiable function on a preconvex set
• Newton's method for optimization problems with a convex smooth surface as a constraint
• The nonlocal Newton method for convex optimization problems and monotone variational inequalities
• scientific article; zbMATH DE number 736943
• A nonsmooth version of Newton's method

Cited in

(8)

• scientific article; zbMATH DE number 779148 (Why is no real title available?)
• Iterative algorithm for minimizing a convex function at the intersection of a spherical surface and a convex compact set
• An alternating iterative method and its application in statistical inference
• scientific article; zbMATH DE number 7300562 (Why is no real title available?)
• An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface
• Newton's method for minimizing a convex twice differentiable function on a preconvex 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
• scientific article; zbMATH DE number 5735028 (Why is no real title available?)

This page was built for publication: Generalization of the Newton method for one class of nonconvex mathematical programming problems

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