Alternating Direction Method for a Class of Sylvester Matrix Equations with Linear Matrix Inequality Constraint

This paper introduces an alternating direction method of multipliers (ADMM) for finding solutions to a class of Sylvester matrix equation AXB = E subject to a linear matrix inequality constraint CXD≥G. Preliminary convergence properties of ADMM are presented. Numerical experiments are performed to illustrate the feasibility and effectiveness of ADMM. In addition, some numerical comparisons with a recent algorithm are also given.     

A Rapidly Convergence Algorithm for Linear Search and its Application

The essence of the linear search is one-dimension nonlinear minimization problem, which is an important part of the multi-nonlinear optimization, it will be spend the most of operation count for solving optimization problem. To improve the efficiency, we set about from quadratic interpolation, combine the advantage of the quadratic convergence rate of Newton's method and adopt the idea of Anderson-Bjorck extrapolation, then we present a rapidly convergence algorithm and give its corresponding convergence conclusions. Finally we did the numerical experiments with the some well-known test functions for optimization and the application test of the ANN learning examples. The experiment results showed the validity of the algorithm.     

A Non-Interior Continuation Algorithm for the P0 or P* LCP with Strong Global and Local Convergence Properties

We propose a non-interior continuation algorithm for the solution of the linear complementarity problem (LCP) with a P₀ matrix. The proposed algorithm differentiates itself from the current continuation algorithms by combining good global convergence properties with good local convergence properties under unified conditions. Specifically, it is shown that the proposed algorithm is globally convergent under an assumption which may be satisfied even if the solution set of the LCP is unbounded. Moreover, the algorithm is globally linearly and locally superlinearly convergent under a nonsingularity assumption. If the matrix in the LCP is a P_* matrix, then the above results can be strengthened to include global linear and local quadratic convergence under a strict complementary condition without the nonsingularity assumption.     

Coderivative calculus and metric regularity for constraint and variational systems

This paper provides new developments in generalized differentiation theory of variational analysis with their applications to metric regularity of parameterized constraint and variational systems in finite-dimensional and infinite-dimensional spaces. Our approach to the study of metric regularity for these two major classes of parametric systems is based on appropriate coderivative constructions for set-valued mappings and on extended calculus rules supporting their computation and estimation. The main attention is paid in this paper to the so-called reversed mixed coderivative, which is of crucial importance for efficient pointwise characterizations of metric regularity in the general framework of set-valued mappings between infinite-dimensional spaces. We develop new calculus results for the latter coderivative that allow us to compute it for large classes of parametric constraint and variational systems. On this basis we derive verifiable sufficient conditions, necessary conditions as well as complete characterizations for metric regularity of such systems with computing the corresponding exact bounds of metric regularity constants/moduli. This approach allows us to reveal general settings in which metric regularity fails for major classes of parametric variational systems. Furthermore, the developed coderivative calculus leads us also to establishing new formulas for computing the radius of metric regularity for constraint and variational systems, which characterize the maximal region of preserving metric regularity under linear (and other types of) perturbations and are closely related to conditioning aspects of optimization.     

Convergence theorems for equilibrium problem, variational inequality problem and countably infinite relatively quasi-nonexpansive mappings

In this paper, we introduce an iterative process which converges strongly to a common element of set of common fixed points of countably infinite family of closed relatively quasi- nonexpansive mappings, the solution set of generalized equilibrium problem and the solution set of the variational inequality problem for a γ-inverse strongly monotone mapping in Banach spaces. Our theorems improve, generalize, unify and extend several results recently announced.