In many optimization problems, a solution can be viewed as ascribing a “cost” to each client and the goal is to optimize some aggregation of the per-client costs. We often optimize some Lp-norm (or some other symmetric convex function or norm) of the vector of costs—though different applications may suggest different norms to use. Ideally, we could obtain a solution that optimized several norms simultaneously
The paper discusses how the used norm and corresponding Lipschitz constant influence the speed of al...
We consider the minimization of the `p norm subject to con-vex constraints. The problem considered i...
The lack of “closed form” solutions for the general linear models resulting from minimising the L0, ...
norms In many optimization problems, a solution can be viewed as ascribing a “cost ” to each client ...
In many optimization problems, a solution can be viewed as ascribing a ``cost\u27\u27 to each clie...
A major drawback in optimization problems and in particular in scheduling problems is that for every...
A major drawback in optimization problems and in particular in scheduling problems is that for every...
Necessary and sufficient conditions for minimizing an $l_1 $-norm type of objective function are der...
AbstractBased on new theoretical results on norms, heuristic algorithms to approximate the nondomina...
In this paper, we formulate the lp-norm optimization problem as a conic optimization problem, derive...
In this paper, we formulate the l p -norm optimization problem as a conic optimization problem, deri...
Abstract. We study the problem of minimizing a sum of p-norms where p is a xed real number in the in...
This dissertation studies first a distributed algorithm to solve general convex optimizationproblems...
Recently, Chakrabarty and Swamy (STOC 2019) introduced the minimum-norm load-balancing problem on un...
International audienceWe show that the Laplace approximation of a supremum by Lp-norms has interesti...
The paper discusses how the used norm and corresponding Lipschitz constant influence the speed of al...
We consider the minimization of the `p norm subject to con-vex constraints. The problem considered i...
The lack of “closed form” solutions for the general linear models resulting from minimising the L0, ...
norms In many optimization problems, a solution can be viewed as ascribing a “cost ” to each client ...
In many optimization problems, a solution can be viewed as ascribing a ``cost\u27\u27 to each clie...
A major drawback in optimization problems and in particular in scheduling problems is that for every...
A major drawback in optimization problems and in particular in scheduling problems is that for every...
Necessary and sufficient conditions for minimizing an $l_1 $-norm type of objective function are der...
AbstractBased on new theoretical results on norms, heuristic algorithms to approximate the nondomina...
In this paper, we formulate the lp-norm optimization problem as a conic optimization problem, derive...
In this paper, we formulate the l p -norm optimization problem as a conic optimization problem, deri...
Abstract. We study the problem of minimizing a sum of p-norms where p is a xed real number in the in...
This dissertation studies first a distributed algorithm to solve general convex optimizationproblems...
Recently, Chakrabarty and Swamy (STOC 2019) introduced the minimum-norm load-balancing problem on un...
International audienceWe show that the Laplace approximation of a supremum by Lp-norms has interesti...
The paper discusses how the used norm and corresponding Lipschitz constant influence the speed of al...
We consider the minimization of the `p norm subject to con-vex constraints. The problem considered i...
The lack of “closed form” solutions for the general linear models resulting from minimising the L0, ...