115 search results - page 3 / 23 » An Efficient Interior-Point Method for Convex Multicriteria ... |
AUTOMATICA
2004
13 years 5 months ago
2004
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...
COLT
2008
Springer
13 years 7 months ago
2008
Springer
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
MP
2008
13 years 5 months ago
2008
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
MP
2002
13 years 5 months ago
2002
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
EOR
2008
13 years 5 months ago
2008
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...