77 search results - page 1 / 16 » A New Exchange Method for Convex Semi-Infinite Programming |
SIAMJO
2010
12 years 11 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
SIAMJO
2008
13 years 4 months ago
2008
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
We recently reported a criterion for blind separation of non-negative sources, using a new concept called convex analysis for mixtures of non-negative sources (CAMNS). Under some ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We give a novel proof of the existence of Nash equilibria in all finite games without using fixed point theorems or path following arguments. Our approach relies on a new notion i...
APPML
2007
13 years 5 months ago
2007
We present a new strategy for choosing primal and dual steplengths in a primal-dual interior-point algorithm for convex quadratic programming. Current implementations often scale ...