Showing 1 - 10 of 11
In this paper we generalize the primal--dual cone affine scaling algorithm of Sturm and Zhang to semidefinite programming.We show in this paper that the underlying ideas of the cone affine scaling algorithm can be naturely applied to semidefiniteprogramming, resulting in a new algorithm....
Persistent link: https://www.econbiz.de/10010325628
Several algorithms are available in the literature for finding the entire set of Pareto-optimal solutions of Multiobjective Linear Programmes (MOLPs). However, all of them are based on active-set methods (simplex-like approaches). We present a different method, based on a transformation of any...
Persistent link: https://www.econbiz.de/10010845814
This paper is a revision of my paper, CFDP 1865. The principal innovation is an equivalent reformulation of the decision problem for weak feasibility of the GE inequalities, using polynomial time ellipsoid methods, as a semidefinite optimization problem, using polynomial time interior point...
Persistent link: https://www.econbiz.de/10011015214
Portfolio optimization problems involving Value-at-Risk (VaR) are often computationally intractable and require complete information about the return distribution of the portfolio constituents, which is rarely available in practice. These difficulties are further compounded when the portfolio...
Persistent link: https://www.econbiz.de/10008491707
In this paper we generalize the primal--dual cone affine scaling algorithm of Sturm and Zhang to semidefinite programming. We show in this paper that the underlying ideas of the cone affine scaling algorithm can be naturely applied to semidefinite programming, resulting in a new algorithm....
Persistent link: https://www.econbiz.de/10005209469
In this paper we generalize the primal--dual cone affine scaling algorithm of Sturm and Zhang to semidefinite programming.We show in this paper that the underlying ideas of the cone affine scaling algorithm can be naturely applied to semidefiniteprogramming, resulting in a new algorithm....
Persistent link: https://www.econbiz.de/10011255524
In this paper we generalize the primal--dual cone affine scaling algorithm of Sturm and Zhang to semidefinite programming.We show in this paper that the underlying ideas of the cone affine scaling algorithm can be naturely applied to semidefiniteprogramming, resulting in a new algorithm....
Persistent link: https://www.econbiz.de/10010336362
Persistent link: https://www.econbiz.de/10014301389
Persistent link: https://www.econbiz.de/10012103328
Persistent link: https://www.econbiz.de/10013411884