The Newton bracketing method for the minimization of convex functions subject to affine constraints

DOI10.1016/j.dam.2007.04.012zbMath1165.90585OpenAlexW2018506069MaRDI QIDQ943833

Yuri Levin, Adi Ben-Israel

Publication date: 10 September 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.04.012

zbMATH Keywords

Fermat-Weber location problemdirectional Newton method

Mathematics Subject Classification ID

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

Related Items (2)

The Newton Bracketing Method for Convex Minimization: Convergence Analysis ⋮ Approximate methods for convex minimization problems with series-parallel structure

Cites Work

• Unnamed Item
• Unnamed Item
• A heuristic method for large-scale multi-facility location problems
• Generalized inverses. Theory and applications.
• Directional Newton methods in $n$ variables
• Matrix Analysis
• The Newton bracketing method for convex minimization.

This page was built for publication: The Newton bracketing method for the minimization of convex functions subject to affine constraints