Results 61 to 70 of about 382,992 (165)

A weighted full-Newton step primal-dual interior point algorithm for convex quadratic optimization

open access: yesStatistics, Optimization & Information Computing, 2014
In this paper a new weighted short-step primal-dual interior point algorithm to solve convex quadratic optimization (CQO) problems. The algorithm uses at each interior iteration afull-Newton step and the strategy of the central to obtain an epsilon-optimal solution of CQO.
openaire   +2 more sources

Let's Make Block Coordinate Descent Go Fast: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence

open access: yes, 2017
Block coordinate descent (BCD) methods are widely-used for large-scale numerical optimization because of their cheap iteration costs, low memory requirements, amenability to parallelization, and ability to exploit problem structure.
Laradji, Issam   +2 more
core  

Home - About - Disclaimer - Privacy