A primal-dual algorithm for minimizing a sum of Euclidean norms

DOI10.1016/S0377-0427(01)00357-0zbMath0994.65066OpenAlexW2035080102MaRDI QIDQ5957946

Liqun Qi, Guanglu Zhou, Defeng Sun

Publication date: 29 September 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(01)00357-0

zbMATH Keywords

numerical resultsprimal-dual algorithmEuclidean facilities locationsum of norms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items (6)

Smoothing SQP algorithm for semismooth equations with box constraints ⋮ 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 ⋮ Smoothing Newton method for minimizing the sum of \(p\) -norms ⋮ Extension of primal-dual interior point methods to diff-convex problems on symmetric cones ⋮ A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing a sum of norms subject to linear equality constraints
• A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
• Solution of monotone complementarity problems with locally Lipschitzian functions
• On superlinear convergence of quasi-Newton methods for nonsmooth equations
• A semismooth equation approach to the solution of nonlinear complementarity problems
• A regularization Newton method for solving nonlinear complementarity problems
• A class of smoothing functions for nonlinear and mixed complementarity problems
• A continuation method for monotone variational inequalities
• Smoothing methods for convex inequalities and linear complementarity problems
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• A nonsmooth version of Newton's method
• A Smoothing Newton Method for Minimizing a Sum of Euclidean Norms
• A quadratically convergent method for minimizing a sum of euclidean norms
• A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
• Beyond Monotonicity in Regularization Methods for Nonlinear Complementarity Problems
• Smooth Approximations to Nonlinear Complementarity Problems
• An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
• Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
• An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
• A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems
• An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms
• An Efficient Algorithm for Minimizing a Sum of p-Norms

This page was built for publication: A primal-dual algorithm for minimizing a sum of Euclidean norms