The Newton bracketing method for convex minimization.

DOI10.1023/A:1013768901780zbMath1087.90058OpenAlexW2135161461MaRDI QIDQ5960309

Yuri Levin, Adi Ben-Israel

Publication date: 15 April 2002

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1013768901780

zbMATH Keywords

convex functionsunconstrained minimizationFermat-Weber location problemdirectional Newton method

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Discrete location and assignment (90B80)

Related Items (8)

The Newton Bracketing Method for Convex Minimization: Convergence Analysis ⋮ On Newton's method for the Fermat-Weber location problem ⋮ A semi-Lagrangian scheme for the game \(p\)-Laplacian via \(p\)-averaging ⋮ The Newton bracketing method for the minimization of convex functions subject to affine constraints ⋮ Approximate methods for convex minimization problems with series-parallel structure ⋮ A heuristic method for large-scale multi-facility location problems ⋮ The trust region subproblem and semidefinite programming* ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions

This page was built for publication: The Newton bracketing method for convex minimization.