Showing 1 - 10 of 16
Persistent link: https://www.econbiz.de/10005287669
We describe a projective algorithm for linear programming that shares features with Karmarkar's projective algorithm and its variants and with the path-following methods of Gonzaga, Kojima-Mizuno-Yoshise, Monteiro-Adler, Renegar, Vaidya and Ye. It operates in a primal-dual setting, stays close...
Persistent link: https://www.econbiz.de/10005463880
In this paper, we propose $\ell_p$-norm regularized models to seek near-optimal sparse portfolios. These sparse solutions reduce the complexity of portfolio implementation and management. Theoretical results are established to guarantee the sparsity of the second-order KKT points of the...
Persistent link: https://www.econbiz.de/10010726306
Space tensors appear in physics and mechanics. Mathematically, they are tensors in the three-dimensional Euclidean space. In the research area of diffusion magnetic resonance imaging, convex optimization problems are formed where higher order positive semi-definite space tensors are involved. In...
Persistent link: https://www.econbiz.de/10010937796
Recently, several new pari-mutuel mechanisms have been introduced to organize markets for contingent claims. Hanson introduced a market maker derived from the logarithmic scoring rule, and later Chen and Pennock developed a cost function formulation for the market maker. On the other hand, the...
Persistent link: https://www.econbiz.de/10005099322
Persistent link: https://www.econbiz.de/10005130492
In Time-of-Use(TOU) pricing schemes, utilities charge rates that depend on the time of day and the season of the year at which electricity is used. Estimates of the effects of TOU rates on business customers in the U.S. and Israel demonstrate that most firms do not appear to respond at all to...
Persistent link: https://www.econbiz.de/10009191617
As most interior point algorithms iterate, they repeatedly perform costly matrix operations, such as projections, on the entire constraint matrix. For large-scale linear programming problems, such operations consume the great majority of the computation time required. However, for problems where...
Persistent link: https://www.econbiz.de/10009198262
We propose a new approach to combine linear programming (LP) interior-point and simplex pivoting algorithms. In any iteration of an interior-point algorithm we construct a related LP problem, which approximates the original problem, with a known (strictly) complementary primal-dual solution...
Persistent link: https://www.econbiz.de/10009204519
Persistent link: https://www.econbiz.de/10009325269