The Newton Bracketing Method for Convex Minimization: Convergence Analysis
From MaRDI portal
Publication:2897275
DOI10.1007/978-1-4419-9569-8_4zbMath1254.90161MaRDI QIDQ2897275
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
convex functions; unconstrained minimization; Fermat-Weber location problem; directional Newton method; Newton bracketing method
Cites Work
- 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.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item