A quadratically convergent method for minimizing a sum of euclidean norms
From MaRDI portal
Publication:3321365
DOI10.1007/BF02591963zbMath0536.65053MaRDI QIDQ3321365
Publication date: 1983
Published in: Mathematical Programming (Search for Journal in Brave)
location theory; nonsmooth optimization; Steiner problem; nondifferentiable optimization; Weber problem; multifacility location problem; Euclidean distance; Fermat problem; perturbation of symmetric matrix with multiple eigenvalues
Related Items
A note on optimality conditions for the Euclidean. Multifacility location problem, Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l1- and l∞-norms, A primal-dual algorithm for minimizing a sum of Euclidean norms, Algebraic optimization: The Fermat-Weber location problem, Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms, Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm, Weighted median algorithms for \(L_ 1\) approximation, Duality for constrained multifacility location problems with mixed norms and applications, Smoothing Newton method for minimizing the sum of \(p\) -norms, Average linear least squares regression, A duality theorem for plastic plates, Geometric interpretation of the optimality conditions in multifacility location and applications, An efficient parallel scheme for minimizing a sum of Euclidean norms, A fixed point algorithm for solving the Euclidean multifacility location problem in a tree, A Newton type algorithm for plastic limit analysis, On the optimality conditions for the problem of minimizing a sum of euclidean norms, When facilities coincide: Exact optimality conditions in multifacility location, A globally convergent algorithm for the Euclidean multiplicity location problem, Heuristic solution of the multisource Weber problem as a \(p\)-median problem, The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review, A globally convergent algorithm for facility location on a sphere, Duality theorem for a generalized Fermat-Weber problem, Theorems of the alternative and duality, Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem, On an open problem in spherical facility location, Algorithms for constrained approximation and optimization. Proceedings of the workshop held in Stowe, VT, USA, May 23-26, 1993, An improved bound for the multifacility location model, The least-gradient method for computing area minimizing hypersurfaces spanning arbitrary boundaries, Second-order nonsmooth optimization for \(H_{\infty}\) synthesis, A primal-dual algorithm for the fermat-weber problem involving mixed gauges
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. I, II
- On discrete Dirichlet and Plateau problems
- Linear convergence of generalized Weiszfeld's method
- Steplength algorithms for minimizing a class of nondifferentiable functions
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- Zur Statik eines gewissen FedersystemsEn
- Inverse Iteration, Ill-Conditioned Equations and Newton’s Method
- Weber's problem and weiszfeld's algorithm in general spaces
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
- Newton-type methods for unconstrained and linearly constrained optimization
- On the Fermat—Weber problem with convex cost functions
- Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
- An Efficient Algorithm for Discrete $l_1$ Linear Approximation with Linear Constraints
- A subgradient algorithm for certain minimax and minisum problems
- Methods for Modifying Matrix Factorizations
- Technical Note—Location Theory: A Selective Bibliography
- Numerical Solution of the Minimal Surface Equation
- Locating facilities in three‐dimensional space by convex programming
- A note on Fermat's problem
