A Modified SQP Method and Its Global Convergence

The sequential quadratic programming method developed by Wilson, Han andPowell may fail if the quadratic programming subproblems become infeasibleor if the associated sequence of search directions is unbounded. In [1], Hanand Burke give a modification to this method wherein the QP subproblem isaltered in a way which guarantees that the associated constraint region isnonempty and for which a robust convergence theory is established. In thispaper, we give a modification to the QP subproblem and provide a modifiedSQP method. Under some conditions, we prove that the algorithm eitherterminates at a Kuhn–Tucker point within finite steps or generates aninfinite sequence whose every cluster is a Kuhn–Tucker point.Finally, we give some numerical examples.     

Sparse representation-based image restoration via nonlocal supervised coding

Sparse representation (SR) and nonlocal technique (NLT) have shown great potential in low-level image processing. However, due to the degradation of the observed image, SR and NLT may not be accurate enough to obtain a faithful restoration results when they are used independently. To improve the performance, in this paper, a nonlocal supervised coding strategy-based NLT for image restoration is proposed. The novel method has three main contributions. First, to exploit the useful nonlocal patches, a nonnegative sparse representation is introduced, whose coefficients can be utilized as the supervised weights among patches. Second, a novel objective function is proposed, which integrated the supervised weights learning and the nonlocal sparse coding to guarantee a more promising solution. Finally, to make the minimization tractable and convergence, a numerical scheme based on iterative shrinkage thresholding is developed to solve the above underdetermined inverse problem. The extensive experiments validate the effectiveness of the proposed method.     

Colorimetric Detection of Fe(II) and Co(II) by Using Terpyridine-Based Derivative

Journal of Applied Spectroscopy - A multi-ion chromogenic sensor based on a terpyridine moiety was developed for the semiquantitative, visual, and sensitive speciation analysis of Fe2+ and Co2+...     

Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems

Most existing interior-point methods for a linear complementarity problem (LCP) require the existence of a strictly feasible point to guarantee that the iterates are bounded. Based on a regularized central path, we present an infeasible interior-point algorithm for LCPs without requiring the strict feasibility condition. The iterates generated by the algorithm are bounded when the problem is a P _* LCP and has a solution. Moreover, when the problem is a monotone LCP and has a solution, we prove that the convergence rate is globally linear and it achieves `-feasibility and `-complementarity in at most O(n ² ln(1/`)) iterations with a properly chosen starting point.     

Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming

In this paper we present a primal-dual inexact infeasible interior-point algorithm for semidefinite programming problems (SDP). This algorithm allows the use of search directions that are calculated from the defining linear system with only moderate accuracy, and does not require feasibility to be maintained even if the initial iterate happened to be a feasible solution of the problem. Under a mild assumption on the inexactness, we show that the algorithm can find an -approximate solution of an SDP in O(n²ln(1/)) iterations. This bound of our algorithm is the same as that of the exact infeasible interior point algorithms proposed by Y. Zhang.Research supported in part by the Singapore-MIT alliance, and NUS Academic Research Grant R-146-000-032-112.Mathematics Subject Classification (1991): 90C05, 90C30, 65K05     

Bolaform supramolecular amphiphiles as a novel concept for the buildup of surface-imprinted films

Stable multilayer films were fabricated on the basis of the alternating layer-by-layer assembly of a two-component bolaform supramolecular amphiphile and diazoresins, followed by photochemical cross-linking of the structure. UV-visible spectroscopy and atomic force microscopy revealed a uniform deposition process. Moreover, one component of the supramolecular amphiphile can be removed from the multilayer films after cross-linking between the second component and the diazoresin. The release and uptake of the imprinted supramolecular amphiphile component are shown to be reversible. Furthermore, uptake experiments of different molecules show the selectivity of the imprinted sites for the template molecule. Thus, surface-imprinted films can be formed by employing dissociable two-component supramolecular amphiphiles. This research reveals that supramolecular amphiphiles can be used as a novel concept for the construction of multilayer films, and it also provides a new method of generating surface-imprinted multilayers.     

The Minimal Process Generated by a Differential Operator of the Second Order in R^n

For a differential operator $\Omega u=\sum\limits_i,j=1^n \frac{\partial}{\partial x_i}(a_ij(x)\frac{\partial u}{\partial x_j})+\sum\limits_{i=1}^n b_i(x)\frac{\partial u}{\partial x_i}+c(x)u$ with unbounded coefficients in R^n, a standard continuous paths process with infinitesimal operator \Omega has been constructed in this paper, and the invariance of such process under a transformation group of phase space has been discussed.     

Singular values of a real rectangular tensor

Real rectangular tensors arise from the strong ellipticity condition problem in solid mechanics and the entanglement problem in quantum physics. In this paper, we systematically study properties of singular values of a real rectangular tensor, and give an algorithm to find the largest singular value of a nonnegative rectangular tensor. Numerical results show that the algorithm is efficient.     

Synthesis of arylstannanes by palladium-catalyzed desulfitative coupling reaction of sodium arylsulfinates with distannanes

A novel Pd-catalyzed desulfitative cross-coupling reaction of sodium arylsulfinates with hexaalkyl distannanes is realized, allowing the facile synthesis of functionalized arylstannanes with moderate to excellent yields. The successful implement of gram-scale synthesis and tandem Stille coupling reaction demonstrates the potential applications of this method in organic synthesis.