One of the most efficient interior-point methods for some classes of block-angular structured problems solves the normal equations by a combination of Cholesky factorizations and preconditioned conjugate gradient for, respectively, the block and linking constraints. In this work we show that the choice of a good preconditioner depends on geometrical properties of the constraints structure. In p...

The prices of aggregate are increasing in India due to the massive demand for natural infrastructure development. An attempt has been made check feasibility past developed technique developing angular-shaped light-weight fly ash coarse from three different types ashes. In this study, effects binder content, water content and hot bath curing temperature on compressive strength blocks, as well im...

High angular resolution (adaptive optics) images taken on August 12, 1995 between 11:26 and 12:23 (UT) show a faint elongated structure apparently moving away from Saturn. The structure is consistent with light scattered by an arc of particles on a Keplerian orbit close to that of Enceladus. The orbit is slightly inclined (1.8 ̊), and the arc is 76 ̊ ahead of the satellite. It appears to be a tra...

Constraints matrices with block-angular structures are pervasive in Optimization. Interior-point methods have shown to be competitive for these structured problems by exploiting the linear algebra. One of these approaches solves the normal equations using sparse Cholesky factorizations for the block constraints, and a preconditioned conjugate gradient (PCG) for the linking constraints. The prec...

This thesis aims to study the theoretical complexity and empirical performance of decomposition algorithms. We focus on linear programs with a block-angular structure. Decomposition algorithms used to be the only way to solve large-scale special structured problems, in terms of memory limit and CPU time. However, with the advances in computer technology over the past few decades, many large-sca...

Deep learning (DL) provides an effective approach for light field (LF) reconstruction that aims to synthesize novel views from sparse-sampled views. However, it is challenging address domain asymmetry when adopting spatial-angular interaction LF methods. To solve this problem, a view-selective angular feature extraction block (VS-LFAFE) proposed obtain full-resolution features enumerate whole v...