An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms
From MaRDI portal
Publication:4877507
DOI10.1137/0806006zbMath0842.90105OpenAlexW2072446998WikidataQ92177955 ScholiaQ92177955MaRDI QIDQ4877507
Publication date: 13 May 1996
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0806006
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Nonsmooth analysis (49J52)
Related Items (15)
An improved extra-gradient method for minimizing a sum of \(p\)-norms -- a variational inequality approach ⋮ Discontinuous piecewise linear optimization ⋮ Applications of second-order cone programming ⋮ Prediction-correction alternating direction method for a class of constrained min-max problems ⋮ On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory ⋮ Smoothing Newton method for minimizing the sum of \(p\) -norms ⋮ An entropy regularization technique for minimizing a sum of Tchebycheff norms ⋮ ℓ 1 -Based Construction of Polycube Maps from Complex Shapes ⋮ A primal-dual algorithm for minimizing a sum of Euclidean norms ⋮ Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l1- and l∞-norms ⋮ An upper-bound limit analysis of Mindlin plates using CS-DSG3 method and second-order cone programming ⋮ Limit analysis of plates using the EFG method and second-order cone programming ⋮ Utility based option pricing with proportional transaction costs and diversification problems: An interior-point optimization approach ⋮ An efficient algorithm for the Euclidean \(r\)-centrum location problem ⋮ Huber approximation for the non-linear \(l_{1}\) problem
This page was built for publication: An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms
