1603 search results - page 71 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
170
click to vote
MP
1998
15 years 5 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
159
click to vote
GECCO
2007
Springer
16 years 11 days ago
2007
Springer
In this paper, we examine how adding objectives to a given optimization problem affects the computation effort required to generate the set of Pareto-optimal solutions. Experime...
167
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
152
click to vote
CSDA
2007
15 years 6 months ago
2007
Of interest here are linear data fitting problems with uncertain data which lie in a given uncertainty set. A robust counterpart of such a problem may be interpreted as the probl...
163
click to vote
ISCAS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...