Minimizing a sum of norms subject to linear equality constraints

DOI10.1023/A:1018322318259zbMath0914.65069OpenAlexW1724112669MaRDI QIDQ1273424

Edmund Christiansen, Knud D. Andersen

Publication date: 14 March 1999

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018322318259

zbMATH Keywords

numerical examplesdualitynon-smooth optimizationNewton barrier methodsum of Euclidean norms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)

Related Items (5)

Automatic mesh refinement in limit analysis ⋮ Prediction-correction alternating direction method for a class of constrained min-max problems ⋮ Smoothing Newton method for minimizing the sum of \(p\) -norms ⋮ Mesh adaptive computation of upper and lower bounds in limit analysis ⋮ A primal-dual algorithm for minimizing a sum of Euclidean norms

This page was built for publication: Minimizing a sum of norms subject to linear equality constraints