Pages that link to "Item:Q4943943"
From MaRDI portal
The following pages link to An Efficient Algorithm for Minimizing a Sum of <i>p</i>-Norms (Q4943943):
Displaying 28 items.
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization (Q263209) (← links)
- The algebraic structure of the arbitrary-order cone (Q289064) (← links)
- Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method (Q447558) (← links)
- A note on the complexity of \(L _{p }\) minimization (Q644905) (← links)
- Conic formulation for \(l_p\)-norm optimization (Q702372) (← links)
- A new class of very efficient algorithms for local dimming (Q724329) (← links)
- An improved extra-gradient method for minimizing a sum of \(p\)-norms -- a variational inequality approach (Q853553) (← links)
- Smoothing Newton method for minimizing the sum of \(p\) -norms (Q946175) (← links)
- An entropy regularization technique for minimizing a sum of Tchebycheff norms (Q969313) (← links)
- An interior-point method for the single-facility location problem with mixed norms using a conic formulation (Q999133) (← links)
- Risk optimization with \(p\)-order conic constraints: a linear programming approach (Q1038319) (← links)
- Duality of nonconvex optimization with positively homogeneous functions (Q1616938) (← links)
- ``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods (Q1771312) (← links)
- On merit functions for \(p\)-order cone complementarity problem (Q2012235) (← links)
- A regularized alternating least-squares method for minimizing a sum of squared Euclidean norms with rank constraint (Q2162388) (← links)
- Efficient algorithms for solving the \(p\)-Laplacian in polynomial time (Q2209522) (← links)
- The decompositions with respect to two core non-symmetric cones (Q2301185) (← links)
- On \(p\)-norm linear discrimination (Q2356201) (← links)
- Monotonicity and circular cone monotonicity associated with circular cones (Q2359137) (← links)
- Robust optimal control with adjustable uncertainty sets (Q2374497) (← links)
- The \(p\)-cones in dimension \(n\geq 3\) are not homogeneous when \(p\neq 2\) (Q2404977) (← links)
- Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations (Q2672063) (← links)
- Polyhedral approximations in<i>p</i>-order cone programming (Q2926080) (← links)
- Towards non-symmetric conic optimization (Q5200566) (← links)
- Characterizations of Boundary Conditions on Some Non-Symmetric Cones (Q5861984) (← links)
- A primal-dual algorithm for minimizing a sum of Euclidean norms (Q5957946) (← links)
- Variational analysis of norm cones in finite dimensional Euclidean spaces (Q6076767) (← links)
- On minimal extended representations of generalized power cones (Q6622743) (← links)