Auxiliary Principle Research Articles

Regularized Nonconvex Mixed Variational Inequalities: Auxiliary Principle Technique and Iterative Methods

In this paper, we turn our attention to formulating and studying a new class of variational inequalities in a nonconvex setting, called regularized nonconvex mixed variational inequalities. By using the auxiliary principle technique, some new predictor corrector methods for solving such class of regularized nonconvex mixed variational inequalities are suggested and analyzed. The study of convergence analysis of the proposed iterative algorithms requires either pseudomonotonicity or partially mixed relaxed and strong monotonicity of the operator involved in regularized nonconvex mixed variational inequalities. As a consequence of our main results, we provide the correct versions of the algorithms and results presented in the literature.

Auxiliary Principle Technique for Variational Inequalities

Auxiliary Principle Technique for Variational Inequalities

Iterative Algorithm for extended mixed equilibrium problem

In this paper, we introduce and study an extended mixed equilibrium problem by using auxiliary principle technique. A generalized predictor-corrector iterative algorithm is defined for solving extended mixed equilibrium problem. The convergence of the method mentioned requires some condition (∗), g-relatively relaxed Lipschitz continuity and relatively g-relaxed monotonicity of the mappings.

On the O(1/n) Convergence Rate of the Auxiliary Problem Principle for Separable Convex Programming and Its Application to the Power Systems Multi-Area Economic Dispatch Problem

The auxiliary problem principle has been widely applied in power systems to solve the multi-area economic dispatch problem. Although the effectiveness and correctness of the auxiliary problem principle method have been demonstrated in relevant literatures, the aspect connected with accurate estimate of its convergence rate has not yet been established. In this paper, we prove the O ( 1 / n ) convergence rate of the auxiliary problem principle method.

Auxiliary principle and iterative algorithms for generalized mixed nonlinear variational-like inequalities

Auxiliary principle and iterative algorithms for generalized mixed nonlinear variational-like inequalities

REGULARIZED EQUILIBRIUM PROBLEMS IN BANACH SPACES

In this works, we consider a class of regularized equilibrium problems in Banach spaces. By using the auxiliary principle techniques to suggest some iterative schemes for regularized equilibrium problems and proved the convergence of these iterative methods required either pseudoaccretivity or partially relaxed strongly accretivity.

A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems

By using auxiliary principle technique, a new proximal point algorithm based on decomposition method is suggested for computing a weakly efficient solution of the constrained multiobjective optimization problem (MOP) without assuming the nonemptiness of its solution set. The optimality conditions for (MOP) are derived by the Lagrangian function of its subproblem and corresponding mixed variational inequality. Some basic properties and convergence results of the proposed method are established under some mild assumptions. As an application, we employ the proposed method to solve a split feasibility problem. Finally, numerical results are also presented to illustrate the feasibility of the proposed algorithm.

Generalized multivalued equilibrium-like problems: auxiliary principle technique and predictor-corrector methods

This paper is dedicated to the introduction a new class of equilibrium problems named generalized multivalued equilibrium-like problems which includes the classes of hemiequilibrium problems, equilibrium-like problems, equilibrium problems, hemivariational inequalities, and variational inequalities as special cases. By utilizing the auxiliary principle technique, some new predictor-corrector iterative algorithms for solving them are suggested and analyzed. The convergence analysis of the proposed iterative methods requires either partially relaxed monotonicity or jointly pseudomonotonicity of the bifunctions involved in generalized multivalued equilibrium-like problem. Results obtained in this paper include several new and known results as special cases.

Auxiliary principle and iterative algorithm for a system of generalized set-valued strongly nonlinear mixed implicit quasi-variational-like inequalities

In this paper, the auxiliary principle technique is extended to study a system of generalized set-valued strongly nonlinear mixed implicit quasi-variational-like inequalities problem in Hilbert spaces. First, we establish the existence of solutions of the corresponding system of auxiliary variational inequalities problem. Then, using the existence result, we construct a new iterative algorithm. Finally, both the existence of solutions of the original problem and the convergence of iterative sequences generated by the algorithm are proved. We give an affirmative answer to the open problem raised by Noor et al. (Korean J. Comput. Appl. Math. 1:73-89, 1998; J. Comput. Appl. Math. 47:285-312, 1993). Our results improve and extend some known results.

A descent method for mixed variational inequalities

A new descent method for solving mixed variational inequalities is developed based on the auxiliary principle problem. Convergence of the proposed method is also demonstrated.

The Auxiliary Problem Principle with Self-Adaptive Penalty Parameter for Multi-Area Economic Dispatch Problem

The auxiliary problem principle is a powerful tool for solving multi-area economic dispatch problem. One of the main drawbacks of the auxiliary problem principle method is that the convergence performance depends on the selection of penalty parameter. In this paper, we propose a self-adaptive strategy to adjust penalty parameter based on the iterative information, the proposed approach is verified by two given test systems. The corresponding simulation results demonstrate that the proposed self-adaptive auxiliary problem principle iterative scheme is robust in terms of the selection of penalty parameter and has better convergence rate compared with the traditional auxiliary problem principle method.

Application Analysis of Computer Technology in Teaching

CAI is a product of the era development and the problems in the process of its advancement which exist in the understanding and the resource reserve are inevitable. For these phenomena, not only the auxiliary and order principle are supposed to be established in the process of applying the computer technology in teaching, but also the CAI's application value ought to be reexamined. The specific training to teachers of different subjects needs to be strengthened and the construction of CAI network database should be consummated in time.

Wiener-Hopf equation technique for solving equilibrium problems and variational inequalities and fixed points of a nonexpansive mapping

In this paper, we introduce some new iterative schemes based on the Wiener-Hopf equation technique and auxiliary principle for finding common elements of the set of solutions of equilibrium problems, the set of fixed points of a nonexpansive mapping and the set of solutions of a variational inequality. Several strong convergence results for the sequences generated by these iterative schemes are established in Hilbert spaces. As the generation, we also consider two generalized variational inequalities, and obtain some iterative schemes and the proposed strong convergence theorems for solving these generalized variational inequalities, equilibrium problems, and a nonexpansive mapping. Our results and proof are new, and they extend the corresponding results of Verma (Appl. Math. Lett. 10:107-109, 1997), Wu and Li (4th International Congress on Image and Signal Processing, pp. 2802-2805, 2011), and Noor and Huang (Appl. Math. Comput. 191:504-510, 2007).

A Predictor-Corrector Method for Solving Equilibrium Problems

We suggest and analyze a predictor-corrector method for solving nonsmooth convex equilibrium problems based on the auxiliary problem principle. In the main algorithm each stage of computation requires two proximal steps. One step serves to predict the next point; the other helps to correct the new prediction. At the same time, we present convergence analysis under perfect foresight and imperfect one. In particular, we introduce a stopping criterion which gives rise toΔ-stationary points. Moreover, we apply this algorithm for solving the particular case: variational inequalities.

Parameter evaluation of auxiliary problem principle for large-scale multi-area economic dispatch

Summary In this paper, a novel with respect to economic dispatch of large-scale multi-area power systems is formulated and studied based on decomposition and coordination algorithm. More precisely, auxiliary problem principle (APP) is applied to overcome the defects of augmented Lagrangian relaxation technology with nonlinear inseparable quadratic terms. The main purpose of this paper is to investigate the intrinsic relationship between APP control parameters and convergence speed, and develop a general criterion that ensures that a suitable control parameter set referring to the implemented APP can be effectively estimated. Theoretical and experimental results of this paper are consistent with each other based on the verification of proposed numerical results. Copyright © 2013 John Wiley & Sons, Ltd.

Predictor–Corrector Methods for General Regularized Nonconvex Variational Inequalities

This paper is devoted to the study of a new class of nonconvex variational inequalities, named general regularized nonconvex variational inequalities. By using the auxiliary principle technique, a new modified predictor–corrector iterative algorithm for solving general regularized nonconvex variational inequalities is suggested and analyzed. The convergence of the iterative algorithm is established under the partially relaxed monotonicity assumption. As a consequence, the algorithm and results presented in the paper overcome incorrect algorithms and results existing in the literature.

Iterative algorithms for generalized mixed equilibrium problems

Abstract In this paper, we consider a generalized mixed equilibrium problem in real Hilbert space. Using the auxiliary principle, we define a class of resolvent mappings. Further, using fixed point and resolvent methods, we give some iterative algorithms for solving generalized mixed equilibrium problem. Furthermore, we prove that the sequences generated by iterative algorithms converge weakly to the solution of generalized mixed equilibrium problem. These results require monotonicity ( θ -pseudo monotonicity) and continuity (Lipschitz continuity) for mappings.

Auxiliary Principle Technique for Solving Split Feasibility Problems

Let K and C be nonempty, closed and convex sets in R n and R m respectively and A be an m £ n real matrix. The split feasibility problem is to find u 2 K with Au 2 C: Many problems arising in the image reconstruction can be formulated in this form. In this paper, we use the auxiliary principle technique to suggest and analyze some new iterative algorithms for solving the split feasibility problems. Our new algorithms include the previously known ones as special cases. We also study the convergence criteria of these algorithms under some weaker conditions. In this respect, our results present a refinement and improvement of the previously known results.

Existence and algorithms for the bilevel new generalized mixed equilibrium problems in Banach spaces

In this paper, we introduce and analyze the new generalized mixed equilibrium problems (NGMEP) and the bilevel new generalized mixed equilibrium problems (BNGMEP) in Banach spaces. First, by using a minimax inequality, some new existence theorems of the solution and the behavior of solution set for the NGMEP and the BNGMEP are obtained in both arbitrary Banach spaces with the coercive conditions and a reflexive Banach space without the coercive conditions. Next, by using auxiliary principle technique, some new iterative algorithms for solving the NGMEP and the BNGMEP are suggested and analyzed. The strong convergence of the iterative sequences generated by the algorithms are also proved in both arbitrary Banach spaces with the coercive conditions and a reflexive Banach space without the coercive conditions. These results are new and generalize some recent results in this field.

Some algorithms for equilibrium problems on Hadamard manifolds

In this paper, we suggest and analyze an iterative method for solving the equilibrium problems on Hadamard manifolds using the auxiliary principle technique. We also consider the convergence analysis of the proposed method under suitable conditions. Some special cases are considered. Results and ideas of this paper may stimulate further research in this fascinating and interesting field.MSC:49J40, 90C33, 26D10, 39B62.