Corrigendum to: on the inheritance of the strongly π-extending property

In this corrigendum, we provide correct versions of Theorem 2.8 and Corollary 3.2, retract two consequences of the previous form of the Theorem 2.8. To this end, the main results of the article remain after the aforementioned changes.     

Minimum-norm fixed point of nonexpansive mappings with applications

The purpose of this paper is to present two new iterative algorithms to find the minimum norm fixed point of nonexpansive nonself-mappings in the framework of Hilbert spaces. The results presented in this paper improve and extend the corresponding ones announced by Yao and Xu [Yao Y, Xu HK. Iterative methods for finding minimum norm fixed point of mappings with applications. Optimization. 2011;60:645–658] and many others. Some applications to convex minimization and split feast problems(SFP) are also included.     

Approximant crystals of icosahedral Mg–(Ga,Al)–Zn alloys

The zero field cooled (ZFC) and field cooled (FC) low-field magnetic moment m of a dense frozen ferrofluid containing Fe₅₅Co₄₅ particles of size 4.6nm in hexane exhibits irreversibility at temperatures T?T _b≈ 30?K. FC in μ ₀ H ≤ 1?T gives rise to shifted minor hysteresis loops below T _b. At T _c≈ 10?K, sharp peaks of m ^ZFC and of the ac susceptibility χ ′, a kink of the thermoremanent magnetic moment m ^TRM, a sizeable reduction of the coercive field H _c, and the appearance of a spontaneous moment m ^SFM indicate a phase transition with near mean-field critical behaviour of both m ^SFM and χ ′ . These features are explained within a core-shell model of nanoparticles, whose strongly disordered shells gradually become blocked below T _b, while their soft ferromagnetic cores couple dipolarly and become superferromagnetic (SFM) below T _c.     

Characterization of the Cone and Applications in Banach Spaces

Abstract

In this article, we first discuss the subduality and orthogonality of the cones and the dual cones when the norm is monotone in Banach spaces. Then, under different assumptions, the necessary and sufficient conditions for the ordering increasing property of the metric projection onto cones and order intervals are studied. Moreover, representations of the metric projection onto cones and order intervals are obtained. As applications, the solvability and approximation results of solutions to nonlinear discontinuous variational inequality and complementarity problems are proved by partial ordering methods.     

An explicit algorithm for monotone variational inequalities

We introduce a fully explicit method for solving monotone variational inequalities in Hilbert spaces, where orthogonal projections onto the feasible set are replaced by projections onto suitable hyperplanes. We prove weak convergence of the whole generated sequence to a solution of the problem, under only the assumptions of continuity and monotonicity of the operator and existence of solutions.     

Local-in-time adjoint-based method for design optimization of unsteady flows

We present a new local-in-time discrete adjoint-based methodology for solving design optimization problems arising in unsteady aerodynamic applications. The new methodology circumvents storage requirements associated with the straightforward implementation of a global adjoint-based optimization method that stores the entire flow solution history for all time levels. This storage cost may quickly become prohibitive for large-scale applications. The key idea of the local-in-time method is to divide the entire time interval into several subintervals and to approximate the solution of the unsteady adjoint equations and the sensitivity derivative as a combination of the corresponding local quantities computed on each time subinterval. Since each subinterval contains relatively few time levels, the storage cost of the local-in-time method is much lower than that of the global methods, thus making the time-dependent adjoint optimization feasible for practical applications. Another attractive feature of the new technique is that the converged solution obtained with the local-in-time method is a local extremum of the original optimization problem. The new method carries no computational overhead as compared with the global implementation of adjoint-based methods. The paper presents a detailed comparison of the global- and local-in-time adjoint-based methods for design optimization problems governed by the unsteady compressible 2-D Euler equations.