An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
From MaRDI portal
Recommendations
- An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms
- An interior-point method for the single-facility location problem with mixed norms using a conic formulation
- A polynomial time dual algorithm for the Euclidean multifacility location problem
- A quadratically convergent method for minimizing a sum of euclidean norms
- An Efficient Algorithm for Minimizing a Sum of p-Norms
Cited in
(42)- A new \(O(\sqrt nL)\) iteration large-update primal-dual interior-point method for second-order cone programming
- An Efficient Algorithm for Minimizing a Sum of p-Norms
- A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
- Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- An entropy regularization technique for minimizing a sum of Tchebycheff norms
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
- The \(Q\) method for second order cone programming
- Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty
- An \(O(\sqrt n L)\) iteration primal-dual path-following method, based on wide neighbourhood and large update, for second-order cone programming
- Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method
- An improved extra-gradient method for minimizing a sum of \(p\)-norms -- a variational inequality approach
- Proximal-point algorithm using a linear proximal term
- Applications of second-order cone programming
- A primal-dual algorithm for minimizing a sum of Euclidean norms
- An efficient parallel scheme for minimizing a sum of Euclidean norms
- A globally convergent non-interior point algorithm with full Newton step for second-order cone programming
- An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms
- Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms
- An exact algorithm for minimizing a sum of Euclidean norms on rays in 2D and 3D
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
- Efficient algorithms for the smallest enclosing ball problem
- Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l1- and l∞-norms
- Remark on Algorithm 539
- A Newton's method for perturbed second-order cone programs
- A regularized alternating least-squares method for minimizing a sum of squared Euclidean norms with rank constraint
- Iterated local search algorithms for the Euclidean Steiner tree problem in \(n\) dimensions
- A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances
- Similarity and other spectral relations for symmetric cones
- An interior-point method for the single-facility location problem with mixed norms using a conic formulation
- A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints
- 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
- Second-order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem
- A new projection and contraction method for linear variational inequalities
- On a modified extragradient method for variational inequality problem with application to industrial electricity production
- Extension of primal-dual interior point methods to diff-convex problems on symmetric cones
- Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem
- Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design
- A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\)
- Smoothing Newton method for minimizing the sum of \(p\) -norms
- An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space
This page was built for publication: An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376153)
