The Newton Bracketing Method for Convex Minimization: Convergence Analysis

DOI10.1007/978-1-4419-9569-8_4zbMath1254.90161OpenAlexW47847039MaRDI QIDQ2897275

Yuri Levin, Adi Ben-Israel

Publication date: 10 July 2012

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

Full work available at URL: https://doi.org/10.1007/978-1-4419-9569-8_4

zbMATH Keywords

convex functionsunconstrained minimizationFermat-Weber location problemdirectional Newton methodNewton bracketing method

Mathematics Subject Classification ID

Convex programming (90C25) Continuous location (90B85) Newton-type methods (49M15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Newton bracketing method for the minimization of convex functions subject to affine constraints
• Variable target value subgradient method
• A method of projection onto an acute cone with level control in convex minimization
• A heuristic method for large-scale multi-facility location problems
• Directional Newton methods in $n$ variables
• The trust region subproblem and semidefinite programming*
• Validation of subgradient optimization
• The Newton bracketing method for convex minimization.

This page was built for publication: The Newton Bracketing Method for Convex Minimization: Convergence Analysis