This study focuses on the topology optimization of structures using a hybrid of level set method (LSM) incorporating sensitivity analysis and isogeometric analysis (IGA). First, the topology optimization problem is formulated using the LSM based on the shape gradient. The shape gradient easily handles boundary propagation with topological changes. In the LSM, the topological gradient method as ...

The co-occurrence pattern of epiphytic lichen communities was evaluated relative to microenvironmental heterogeneity along an edge-interior forest gradient. We collected data on the occurrence of 57 epiphytic lichen species from 452 plots in a Mediterranean forest remnant. We used two realistic null models to test for non-randomness in the structure of epiphytic lichen communities and generaliz...

In this paper the analysis of gray level corner detection has been carried out. Performances of various cornerness measures are discussed with respect to four performances of robustness: detection, localization, stability and complexity. We have analyzed the interior di€erential features of the image surface of these cornerness measures. This paper presents a new approach called gradient-direct...

In this paper, we introduce the truncated primal-infeasible dual-feasible interior point algorithm for linear programming and describe an implementation of this algorithm for solving the minimum cost network flow problem. In each iteration, the linear system that determines the search direction is computed inexactly, and the norm of the resulting residual vector is used in the stopping criteria...

Logistic regression with `1 regularization has been proposed as a promising method for feature selection in classification problems. In this paper we describe an efficient interior-point method for solving large-scale `1-regularized logistic regression problems. Small problems with up to a thousand or so features and examples can be solved in seconds on a PC; medium sized problems, with tens of...

The limiting factors of second-order methods for large-scale semidefinite optimization are the storage and factorization of the Newton matrix. For a particular algorithm based on the modified barrier method, we propose to use iterative solvers instead of the routinely used direct factorization techniques. The preconditioned conjugate gradient method proves to be a viable alternative for problem...