A sulfate-encapsulating complex, [Cu(1)L(6)]·3[Cu(2)L(2)(DMF)(4)](SO(4))(4) (1, L = N-(1-naphthyl)-N'-(3-pyridyl)urea) is synthesized in which two C(3)-clefts of the octahedral complexes interdigitate to form a cavity to encapsulate the sulfate ion by six urea groups. 相似文献
Minimization with orthogonality constraints (e.g., $X^\top X = I$) and/or spherical constraints (e.g., $\Vert x\Vert _2 = 1$) has wide applications in polynomial optimization, combinatorial optimization, eigenvalue problems, sparse PCA, p-harmonic flows, 1-bit compressive sensing, matrix rank minimization, etc. These problems are difficult because the constraints are not only non-convex but numerically expensive to preserve during iterations. To deal with these difficulties, we apply the Cayley transform—a Crank-Nicolson-like update scheme—to preserve the constraints and based on it, develop curvilinear search algorithms with lower flops compared to those based on projections and geodesics. The efficiency of the proposed algorithms is demonstrated on a variety of test problems. In particular, for the maxcut problem, it exactly solves a decomposition formulation for the SDP relaxation. For polynomial optimization, nearest correlation matrix estimation and extreme eigenvalue problems, the proposed algorithms run very fast and return solutions no worse than those from their state-of-the-art algorithms. For the quadratic assignment problem, a gap 0.842 % to the best known solution on the largest problem “tai256c” in QAPLIB can be reached in 5 min on a typical laptop. 相似文献
This paper introduces an algorithm for the nonnegative matrix factorization-and-completion problem, which aims to find nonnegative
low-rank matrices X and Y so that the product XY approximates a nonnegative data matrix M whose elements are partially known (to a certain accuracy). This problem aggregates two existing problems: (i) nonnegative
matrix factorization where all entries of M are given, and (ii) low-rank matrix completion where nonnegativity is not required. By taking the advantages of both nonnegativity
and low-rankness, one can generally obtain superior results than those of just using one of the two properties. We propose
to solve the non-convex constrained least-squares problem using an algorithm based on the classical alternating direction
augmented Lagrangian method. Preliminary convergence properties of the algorithm and numerical simulation results are presented.
Compared to a recent algorithm for nonnegative matrix factorization, the proposed algorithm produces factorizations of similar
quality using only about half of the matrix entries. On tasks of recovering incomplete grayscale and hyperspectral images,
the proposed algorithm yields overall better qualities than those produced by two recent matrix-completion algorithms that
do not exploit nonnegativity. 相似文献
In this paper, a novel stochastic extra-step quasi-Newton method is developed to solve a class of nonsmooth nonconvex composite optimization problems. We assume that the gradient of the smooth part of the objective function can only be approximated by stochastic oracles. The proposed method combines general stochastic higher order steps derived from an underlying proximal type fixed-point equation with additional stochastic proximal gradient steps to guarantee convergence. Based on suitable bounds on the step sizes, we establish global convergence to stationary points in expectation and an extension of the approach using variance reduction techniques is discussed. Motivated by large-scale and big data applications, we investigate a stochastic coordinate-type quasi-Newton scheme that allows to generate cheap and tractable stochastic higher order directions. Finally, numerical results on large-scale logistic regression and deep learning problems show that our proposed algorithm compares favorably with other state-of-the-art methods.
We present an alternating direction dual augmented Lagrangian method for solving semidefinite programming (SDP) problems in standard form. At each iteration, our basic algorithm minimizes the augmented Lagrangian function for the dual SDP problem sequentially, first with respect to the dual variables corresponding to the linear constraints, and then with respect to the dual slack variables, while in each minimization keeping the other variables fixed, and then finally it updates the Lagrange multipliers (i.e., primal variables). Convergence is proved by using a fixed-point argument. For SDPs with inequality constraints and positivity constraints, our algorithm is extended to separately minimize the dual augmented Lagrangian function over four sets of variables. Numerical results for frequency assignment, maximum stable set and binary integer quadratic programming problems demonstrate that our algorithms are robust and very efficient due to their ability or exploit special structures, such as sparsity and constraint orthogonality in these problems. 相似文献
N-Tosyl-2,6-diisopropyl-4-(2,3-dimethoxylbenzoylamide)aniline (1) has been synthesized and its metal ion (Na+, K+, Ca2+, Mg2+) coordinating properties investigated by FT-IR, ESI-MS, and 1H NMR methods. Among the tested metal ions, the overall stability constant (log K) for Mg2+ (6.89) is the highest (Na+, 5.64; K+, 5.43; Ca2+, 5.51) in 10% water/THF at 25.0 ± 0.5 °C determined by UV-vis spectroscopy, indicating that 1 is a potent ionophore for Mg2+ ion. 相似文献
Science China Mathematics - In this work, we present probabilistic local convergence results for a stochastic semismooth Newton method for a class of stochastic composite optimization problems... 相似文献