The Newton bracketing method for convex minimization.
From MaRDI portal
Publication:5960309
DOI10.1023/A:1013768901780zbMath1087.90058MaRDI QIDQ5960309
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
convex functions; unconstrained minimization; Fermat-Weber location problem; directional Newton method
90C25: Convex programming
90C30: Nonlinear programming
90C53: Methods of quasi-Newton type
90B80: Discrete location and assignment
Related Items
The trust region subproblem and semidefinite programming*, The Weiszfeld Algorithm: Proof, Amendments, and Extensions, 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, A heuristic method for large-scale multi-facility location problems, Approximate methods for convex minimization problems with series-parallel structure, The Newton Bracketing Method for Convex Minimization: Convergence Analysis