The Newton bracketing method for convex minimization.

DOI10.1023/A:1013768901780MaRDI QIDQ5960309zbMATH OpenOpenAlexFDO

Authors 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 functionsdirectional Newton methodFermat-Weber location problemunconstrained minimization

Mathematics Subject Classification ID

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

Recommendations

• The Newton bracketing method for the minimization of convex functions subject to affine constraints
• The Newton bracketing method for convex minimization: convergence analysis
• On Newton's method for the Fermat-Weber location problem
• A Newton-like method for convex functions
• Newton's method for minimizing a convex twice differentiable function on a preconvex set

Cited in

(10)

• A bracketing technique to ensure desirable convergence in univariate minimization
• 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
• On Newton's method for the Fermat-Weber location problem
• A semi-Lagrangian scheme for the game \(p\)-Laplacian via \(p\)-averaging
• The trust region subproblem and semidefinite programming*
• A Newton-bracketing method for a simple conic optimization problem
• The Weiszfeld Algorithm: Proof, Amendments, and Extensions
• The Newton bracketing method for the minimization of convex functions subject to affine constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5960309)