A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem

This paper deals with the split feasibility problem that requires to find a point closest to a closed convex set in one space such that its image under a linear transformation will be closest to another closed convex set in the image space. By combining perturbed strategy with inertial technique, we construct an inertial perturbed projection algorithm for solving the split feasibility problem. Under some suitable conditions, we show the asymptotic convergence. The results improve and extend the algorithms presented in Byrne (2002) and in Zhao and Yang (2005) and the related convergence theorem

An Explicit Method for the Split Feasibility Problem with Self-Adaptive Step Sizes

An explicit iterative method with self-adaptive step-sizes for solving the split feasibility problem is presented. Strong convergence theorem is provided

Explicit mixed strain–displacement finite elements for compressible and quasi-incompressible elasticity and plasticity

The final publication is available at Springer via http://dx.doi.org/ 10.1007/s00466-016-1305-zThis paper presents an explicit mixed finite element formulation to address compressible and quasi-incompressible problems in elasticity and plasticity. This implies that the numerical solution only involves diagonal systems of equations. The formulation uses independent and equal interpolation of displacements and strains, stabilized by variational subscales. A displacement sub-scale is introduced in order to stabilize the mean-stress field. Compared to the standard irreducible formulation, the proposed mixed formulation yields improved strain and stress fields. The paper investigates the effect of this enhancement on the accuracy in problems involving strain softening and localization leading to failure, using low order finite elements with linear continuous strain and displacement fields (P1P1 triangles in 2D and tetrahedra in 3D) in conjunction with associative frictional Mohr–Coulomb and Drucker–Prager plastic models. The performance of the strain/displacement formulation under compressible and nearly incompressible deformation patterns is assessed and compared to analytical solutions for plane stress and plane strain situations. Benchmark numerical examples show the capacity of the mixed formulation to predict correctly failure mechanisms with localized patterns of strain, virtually free from any dependence of the mesh directional bias. No auxiliary crack tracking technique is necessary.Peer ReviewedPostprint (author's final draft

Application of Tikhonov Regularized Methods to Image Deblurring Problem

We consider the monotone inclusion problems in real Hilbert spaces. Proximal splitting algorithms are very popular technique to solve it and generally achieve weak convergence under mild assumptions. Researchers assume strong conditions like strong convexity or strong monotonicity on the considered operators to prove strong convergence of the algorithms. Mann iteration method and normal S-iteration method are popular methods to solve fixed point problems. We propose a new common fixed point algorithm based on normal S-iteration method {using Tikhonov regularization }to find common fixed point of nonexpansive operators and prove strong convergence of the generated sequence to the set of common fixed points without assuming strong convexity and strong monotonicity. Based on the proposed fixed point algorithm, we propose a forward-backward-type algorithm and a Douglas-Rachford algorithm in connection with Tikhonov regularization to find the solution of monotone inclusion problems. Further, we consider the complexly structured monotone inclusion problems which are very popular these days. We also propose a strongly convergent forward-backward-type primal-dual algorithm and a Douglas-Rachford-type primal-dual algorithm to solve the monotone inclusion problems. Finally, we conduct a numerical experiment to solve image deblurring problems

Modeling mechanical response of heterogeneous materials

Heterogeneous materials are ubiquitous in nature and as synthetic materials. These materials provide unique combination of desirable mechanical properties emerging from its heterogeneities at different length scales. Future structural and technological applications will require the development of advanced light weight materials with superior strength and toughness. Cost effective design of the advanced high performance synthetic materials by tailoring their microstructure is the challenge facing the materials design community. Prior knowledge of structure-property relationships for these materials is imperative for optimal design. Thus, understanding such relationships for heterogeneous materials is of primary interest. Furthermore, computational burden is becoming critical concern in several areas of heterogeneous materials design. Therefore, computationally efficient and accurate predictive tools are highly essential. In the present study, we mainly focus on mechanical behavior of soft cellular materials and tough biological material such as mussel byssus thread. Cellular materials exhibit microstructural heterogeneity by interconnected network of same material phase. However, mussel byssus thread comprises of two distinct material phases. A robust numerical framework is developed to investigate the micromechanisms behind the macroscopic response of both of these materials. Using this framework, effect of microstuctural parameters has been addressed on the stress state of cellular specimens during split Hopkinson pressure bar test. A voronoi tessellation based algorithm has been developed to simulate the cellular microstructure. Micromechanisms (microinertia, microbuckling and microbending) governing macroscopic behavior of cellular solids are investigated thoroughly with respect to various microstructural and loading parameters. To understand the origin of high toughness of mussel byssus thread, a Genetic Algorithm (GA) based optimization framework has been developed. It is found that two different material phases (collagens) of mussel byssus thread are optimally distributed along the thread. These applications demonstrate that the presence of heterogeneity in the system demands high computational resources for simulation and modeling. Thus, Higher Dimensional Model Representation (HDMR) based surrogate modeling concept has been proposed to reduce computational complexity. The applicability of such methodology has been demonstrated in failure envelope construction and in multiscale finite element techniques. It is observed that surrogate based model can capture the behavior of complex material systems with sufficient accuracy. The computational algorithms presented in this thesis will further pave the way for accurate prediction of macroscopic deformation behavior of various class of advanced materials from their measurable microstructural features at a reasonable computational cost

Humanoid gait generation via MPC: stability, robustness and extensions

Research on humanoid robots has made significant progress in recent years, and Model Predictive Control (MPC) has seen great applicability as a technique for gait generation. The main advantages of MPC are the possibility of enforcing constraints on state and inputs, and the constant replanning which grants a degree of robustness. This thesis describes a framework based on MPC for humanoid gait generation, and analyzes some theoretical aspects which have often been neglected. In particular, the stability of the controller is proved. Due to the presence of constraints, this requires proving recursive feasibility, i.e., that the algorithm is able to recursively guarantee that a solution satisfying the constraints is found. The scheme is referred to as Intrinsically Stable MPC (IS-MPC). A basic scheme is presented, and its stability and feasibility guarantees are discussed. Then, several extensions are introduced. The guarantees of the basic scheme are carried over to a robust version of IS-MPC. Furthermore, extension to uneven ground and to a more accurate multi-mass model are discussed. Experiments on two robotic platforms (the humanoid robots HRP-4 and NAO) are presented in the concluding section

First order algorithms in variational image processing

Variational methods in imaging are nowadays developing towards a quite universal and flexible tool, allowing for highly successful approaches on tasks like denoising, deblurring, inpainting, segmentation, super-resolution, disparity, and optical flow estimation. The overall structure of such approaches is of the form ${\cal D}(Ku) + \alpha {\cal R} (u) \rightarrow \min_u$ ; where the functional ${\cal D}$ is a data fidelity term also depending on some input data $f$ and measuring the deviation of $Ku$ from such and ${\cal R}$ is a regularization functional. Moreover $K$ is a (often linear) forward operator modeling the dependence of data on an underlying image, and $\alpha$ is a positive regularization parameter. While ${\cal D}$ is often smooth and (strictly) convex, the current practice almost exclusively uses nonsmooth regularization functionals. The majority of successful techniques is using nonsmooth and convex functionals like the total variation and generalizations thereof or $\ell_1$-norms of coefficients arising from scalar products with some frame system. The efficient solution of such variational problems in imaging demands for appropriate algorithms. Taking into account the specific structure as a sum of two very different terms to be minimized, splitting algorithms are a quite canonical choice. Consequently this field has revived the interest in techniques like operator splittings or augmented Lagrangians. Here we shall provide an overview of methods currently developed and recent results as well as some computational studies providing a comparison of different methods and also illustrating their success in applications.Comment: 60 pages, 33 figure