An Efficient Algorithm for Minimizing a Sum of p-Norms
From MaRDI portal
Publication:4943943
DOI10.1137/S1052623497327088zbMath0955.68126OpenAlexW1963653477MaRDI QIDQ4943943
Publication date: 19 March 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623497327088
polynomial time algorithmsSteiner minimum treesfacilities locationminimizing a sum of normsprimal-dual potential reduction algorithmsshortest network under a given topology
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Nonnumerical algorithms (68W05)
Related Items
Monotonicity and circular cone monotonicity associated with circular cones, Duality of nonconvex optimization with positively homogeneous functions, The algebraic structure of the arbitrary-order cone, Robust optimal control with adjustable uncertainty sets, 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, Polyhedral approximations inp-order cone programming, The \(p\)-cones in dimension \(n\geq 3\) are not homogeneous when \(p\neq 2\), Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations, Variational analysis of norm cones in finite dimensional Euclidean spaces, Duality of optimization problems with gauge functions, Efficient algorithms for solving the \(p\)-Laplacian in polynomial time, Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method, A note on the complexity of \(L _{p }\) minimization, Smoothing Newton method for minimizing the sum of \(p\) -norms, An entropy regularization technique for minimizing a sum of Tchebycheff norms, Conic formulation for \(l_p\)-norm optimization, On merit functions for \(p\)-order cone complementarity problem, ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods, A new class of very efficient algorithms for local dimming, A primal-dual algorithm for minimizing a sum of Euclidean norms, Towards non-symmetric conic optimization, An interior-point method for the single-facility location problem with mixed norms using a conic formulation, The decompositions with respect to two core non-symmetric cones, Risk optimization with \(p\)-order conic constraints: a linear programming approach, Characterizations of Boundary Conditions on Some Non-Symmetric Cones, On \(p\)-norm linear discrimination, Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization
Uses Software
