An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
From MaRDI portal
Publication:4376153
DOI10.1137/S1052623495288362zbMath0885.68074OpenAlexW2022204379MaRDI QIDQ4376153
Publication date: 10 February 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623495288362
polynomial timeinterior-point algorithmEuclidean facilities locationSteiner minimum treesminimizing a sum of Euclidean normsshortest networks
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Parallel algorithms in computer science (68W10)
Related Items
Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty, A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming, A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ, Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem, A Newton's method for perturbed second-order cone programs, An improved extra-gradient method for minimizing a sum of \(p\)-norms -- a variational inequality approach, A regularized alternating least-squares method for minimizing a sum of squared Euclidean norms with rank constraint, Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms, Applications of second-order cone programming, Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design, On a modified extragradient method for variational inequality problem with application to industrial electricity production, A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\), Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method, A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation, On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory, On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators, Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations, The \(Q\) method for second order cone programming, Smoothing Newton method for minimizing the sum of \(p\) -norms, Extension of primal-dual interior point methods to diff-convex problems on symmetric cones, An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming, An entropy regularization technique for minimizing a sum of Tchebycheff norms, Efficient algorithms for the smallest enclosing ball problem, A globally convergent non-interior point algorithm with full Newton step for second-order cone programming, A primal-dual algorithm for minimizing a sum of Euclidean norms, An interior-point method for the single-facility location problem with mixed norms using a conic formulation, Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l1- and l∞-norms, A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints, An overview of exact algorithms for the Euclidean Steiner tree problem inn-space, Insight into the computation of Steiner minimal trees in Euclidean space of general dimension, Iterated local search algorithms for the Euclidean Steiner tree problem inndimensions, Proximal-point algorithm using a linear proximal term, Similarity and other spectral relations for symmetric cones, A new projection and contraction method for linear variational inequalities, A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming, An Exact Algorithm for Minimizing a Sum of Euclidean Norms on Rays in 2D and 3D
