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

zbMath1302.90158MaRDI QIDQ462571

J. Herrera, D. Rodríguez-Gómez

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)

Related Items

An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface, 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