Research Article A Novel Filled Function Method for Nonlinear Equations
|
|
- Kory Hood
- 5 years ago
- Views:
Transcription
1 Applied Mathematics, Article ID 24759, 7 pages Research Article A Novel Filled Function Method for Nonlinear Equations Liuyang Yuan and Qiuhua Tang 2 College of Sciences, Wuhan University of Science and Technology, Wuhan, Hubei 43008, China 2 Industrial Engineering Department, Wuhan University of Science and Technology, Wuhan, Hubei 43008, China Correspondence should be addressed to Liuyang Yuan; yangly060@26.com Received 24 December 203; Accepted 26 May 204; Published 2 June 204 Academic Editor: Nan-Jing Huang Copyright 204 L. Yuan and Q. Tang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. A novel filled function method is suggested for solving box-constrained systems of nonlinear equations. Firstly, the original problem is converted into an equivalent global optimization problem. Subsequently, a novel filled function with one parameter is proposed for solving the converted global optimization problem. Some properties of the filled function are studied and discussed. Finally, an algorithm based on the proposed novel filled function for solving systems of nonlinear equations is presented. The objective function value can be reduced by quarter in each iteration of our algorithm. The implementation of the algorithm on several test problems is reported with satisfactory numerical results.. Introduction Systems of nonlinear equations arise in myriad applications, for example, in engineering, physics, mechanics, applied mathematics and sciences; see [] for a more detailed description. In this paper, we consider the following box-constrained systems of nonlinear equations for short, SNE: F x =0, x X, SNE where the mapping F:R n R m is continuous, x R n is a box. Generally, systems of nonlinear equations are very difficult to solve directly. The typical methods to solve SNE are optimization-basedmethodsinwhich SNE is reformulated as an optimization problem. The most popular optimizationbased methods involve solving the following optimization problem for short OP: min s.t. f x = 2 FxT F x x X OP to find solutions of SNE. Note that the problem above is a box-constrained nonlinear least-squares problem. It is easy to see that the objective function satisfies fx 0 and global optimal solutions of problem OP with the zero objective function value corresponding to solutions of SNE. Generally speaking, the traditional optimization-based methods for solving SNE are often stuck at a stationary point or a local minimizer of the corresponding optimization problem, which is not necessarily a solution of the original system.lately,greateffortshavebeenmadetoovercome the difficulty caused by nonglobal minimizers. In Particular, some switching techniques [2 6] have been developed to escape from a stationary point or a local minimizer which is not a solution of SNE. Kanzow [3] incorporated two well-known global optimization algorithms, namely, a tunneling [7] and a filled function method [8], into a standard nonsmooth Newton-type method for solving a nonsmooth system of equations which is a reformulation of the mixed complementarity problem. Wu et al. [9] andlinetal.[0, ] also gave some filled function methods to solve a nonlinear system with box constraints. Wang et al. [2] gave a filled function method to solve an unconstrained nonlinear system. In this paper, we will propose another kind of filled function method to solve boxconstrained systems of nonlinear equations. Unlike [3], we do not use any Newton-type methods to solve SNE, and,also unlike [9, 0], a better initial point of the primal optimization
2 2 Applied Mathematics problem sometimes can not be obtained by minimizing the constructed filled function locally. Moreover, unlike [, 2], the exponential term was used in the construct of the filled function, which may increase the computability when applied to numerical optimization. Instead, in this paper, we use an efficient filled function method to solve the corresponding optimization problem, and the local minimizer of the filled function is always obtained in the interior and is always good point. The objective function value can be reduced by quarter in each iteration of our algorithm. The existence of local minimizers other than global ones makes global optimization a great challenge. As one of the main methods to solve general unconstrained or boxconstrained global optimization problems without special structural property, the filled function method has attracted extensive attention; see [8 5]. The main idea of the filled function method is to construct an auxiliary function called filled function via the current local minimizer of the original optimization problem, with the property that the current local minimizer is a local maximizer of the constructed filled function and a better initial point of the primal optimization problem can be obtained by minimizing the constructed filled function locally. However, generally speaking, the local minimizer of the filled function cannot ensure that it is a better point of the primal optimization problem. In the paper, we propose a new filled function method, which can ensure that the proposed function is an efficient filled function and the local minimizer of the new filled function on a given box set is a better point and the primal problem s objective value at this better point can be reduced by quarter in each iteration of our filled function algorithm. The numerical results obtained show that our method is applicable and efficient. The paper is organized as follows. Following this introduction, a novel filled function is proposed for the optimization problem in Section 2. The corresponding algorithm is presented in Section 3. In Section 4, several numerical examples are reported. Finally, some conclusions are drawn in Section Filled Function for the Optimization Problem Throughout this paper we make the following assumption. Assumption. SNE hasatleastonesolutioninx and the number of solutions of SNE is finite. Suppose that x is a local miminizer of problem OP,the definition of the filled function is as follows. Definition 2. A continuously differentiable function px, x is called a filled function of problem OP at x, if it satisfies the following conditions: x is a strict local maximizer of px, x on X; 2 px, x has no stationary point in the region S = {x : fx > fx /4, x X \ {x }}; 3 If x is not a global minimizer of problem OP,then px, x does have a minimizer in the region S 2 ={x: fx fx /4, x X}. These conditions of the new filled function ensure that when a descent method, for example, the steepest descent method, is employed to minimize the constructed filled function, the sequence of iteration points will not terminate at any point at which the objective function value is large than fx /4;ifx isnotaglobalminimizerofproblemop,then there must exist a minimizer of the filled function at which the objective function value is less than or equal to fx /4, namely, any local minimizer of px, x must belong to the set S 2 ={x:fx fx /4, x X}. Therefore, the present local minimizer of the objective function escapes and a better minimizer can be found by a local search algorithm starting from the minimizer of the filled function. Let LP denote the set of local minimizers of problem OP and let GP denote the set of global minimizers of problem OP. In the following, a novel filled function with one parameter satisfying Definition 2 is introduced. To begin with, we design a continuously differentiable function ht with the following properties: it is equal to 0 when t>0. More specifically, we construct ht as follows: 0, t > 0, h t ={ t 2, t 0. It is not difficult to check that ht is continuously differentiable and decreasing on R.Obviously,we have h 0, t > 0, t ={ 2t, t 0. Given x LP, the following filled function with one parameter is constructed: Fx,x,q= + x x +qhfx fx, 3 4 where the only parameter q > 0. Clearly, Fx, x,q is continuously differentiable on R n. The following theorems show that Fx, x,q satisfy Definition 2 when the positive parameter q is sufficiently large. Theorem 3. Let x LP, q>0.then,x is a strict local maximizer of Fx, x,qon X. Proof. Since x LP, there exists a neighborhood Nx,σ of x with σ>0such that fx fx,forallx Nx,σ, where Nx,σ = {x x x < σ}.then,foranyx Nx,σ, x =x, q>0,andht 0.Wehave Fx,x,q= 2 + x x <=Fx,x,q. 4 Thus, x is a strict local maximizer of Fx, x,qon X.
3 Applied Mathematics 3 Theorem 3 reveals that the proposed new filled function satisfies condition of Definition 2. Theorem 4. Let x LP, q>0.then,fx, x,qhas no stationary point in the region S ={x:fx>fx /4, x X\{x }}. Proof. Assume that x S,namely,fx > fx /4 and x =x. Then, we have F x, x,q= x x + x x 2 x x, F x, x,q x x x x = + x x 2 <0. It implies that the function Fx, x,qhas no stationary point in the region S ={x:fx>fx /4, x X \ {x }}. Theorem 4 revealsthattheproposednewfilledfunction satisfies condition 2 of Definition 2. Theorem 5. Let x LP, butx GP. AndSNE satisfies Assumption.Then,Fx, x,qdoes have a minimizer in the region S 2 ={x:fx fx /4, x X} when q>0is sufficiently large. Proof. Since x LP, butx GP, and the global minimum of fx is zero, there exists an x LOP such that fx fx /4. Bythecontinuityoffx and Assumption, there exists σ > 0 that is small enough and x Nx,σ,anditholdsfx fx fx /4 = fx, for all x Nx,σ,whereNx,σ={x X: x x <σ}. Here,wejustgivetheprooftothecasewhen x x x x. For the other case when x x > x x,the proof is similar. Therefore, for each x Nx, σ = {x X : x x < σ}, there are two cases: fx > fx = fx /4; 2 fx fx = fx /4. For case, by fx fx /4 > fx fx /4 = 0 and x x < x x, Fx,x,q= 5 + x x > + x x =Fx, x,q. 6 For case 2, by fx fx /4 fx fx /4 = 0 and x x < x x,wehavefx, x,q < Fx,x,qif and only if + x x < which is equivalent to q> + x x +qfx fx 4 2, 7 x x x x f x fx /4 2 + x x + x x >0. 8 Let q 0 = x x x x f x fx /4 2 + x x + x x. 9 Thus, there exists sufficiently large q 0 > 0 as function fx approaches fx /4. Consequently, it must has that Fx, x,q < Fx,x,q for all x Nx, σ when q>q 0. Thus, x S 2 is a minimizer of Fx, x,q when q > 0 is sufficiently large. Theorems 5 show that, for all q q 0, Fx, x,qsatisfies Condition 3 of Definition 2. Thefollowingtheoremsshow that function Fx, x,qhas some interesting properties. Theorem 6. Let x,x 2 Xand the following conditions hold: i min{fx, fx 2 } /4fx ; ii x 2 x > x x. Then, the inequality Fx,x,q > Fx 2,x,q holds for all q>0. Proof. Since min{fx, fx 2 } /4fx,then Fx,x,q= + x, x Fx 2,x,q= + x. 2 x Therefore, for all q>0, Fx,x,q>Fx 2,x,qholds. Theorem 7. Fx, x,q>0for all x X. 0 Proof. Bytheformofthefilledfunction3 and since ht 0, we have Fx, x,q>0for all x X. Remark 8. In the phase of minimizing the filled function, Theorems 3 5 guarantee that the present local minimizer x of the objective function is escaped and the minimum of the filled function will be always achieved at a point where the objective function value is not greater than the quarterofthecurrentminimumoftheobjectivefunction. Moreover, the proposed filled function does not include exponential terms. A continuously differentiable function is used in the constructed filled function, which possesses many good properties and is efficient in numerical implementation. 3. Filled Function Algorithm The theoretical properties of the proposed filled function Fx, x,qwere discussed in the last section. In this section, a global optimization method for solving problem OP is presented based on the constructed filled function 3, which leads to a solution or an approximate solution to SNE. Suppose that SNE has at least one solution and the number of solutions is finite. The general idea of the global optimization method is as follows.
4 4 Applied Mathematics Let x 0 Xbeagiven initial point. Starting from this initial point, a local minimizer x 0 of problem OP is obtained with a local minimization method Newton method, Quasi- Newton Method, or Conjugate Gradient method. If x 0 is not a global minimizer, the main task is to find a better local minimizer of problem OP. Consider the following filled function problem for short FFP: min x X Fx,x k,q, FFP where Fx, x k,qis given by 3. Let x 0 be a obtained local minimizer of problem FFP on X,andthenbyTheorem 5,wehavefx 0 fx 0 /4.Starting from this initial point x 0, we can obtain a local minimizer x of problem OP.Ifx is a global minimizer namely, fx = 0, x is the solution of the system SNE; otherwise,locally solve problem FFP.Letx be the obtained local minimizer, andthenwehavethatfx fx 0 /42.Repeatingthis process, we can finally obtain a solution of the system SNE or a sequence {x k } with fx k <fx 0 /4k, k=,2,...for such a sequence {x k }, k=,2,...,whenkis sufficiently large, x k can be regarded as an approximate solution of the system SNE. Let x Xand ε>0,andx is called a ε-approximate solution of the system SNE if x Xand fx ε. The corresponding filled function algorithm for the global optimization problem OP is described as follows. The algorithm is referred as FFSNE the filled function method for SNE. Algorithm FFSNE Step 0. Choosesmallpositivenumbersε, λ, alargepositive number q U,andaninitialvalueq 0 for the parameters q.e.g., ε=0 8, λ=0 5, q U =0 20,andq 0 =0 0. Choose a positive integer number K e.g., K=2nanddirectionse i, i =,...,K, are the coordinate directions. Choose an initial point x 0 X.Setk:= 0. If fx 0 ε,thenletx k := x 0 and go to Step 6.Otherwise, let q:=q 0 and go to Step. Step. Find a local minimizer x k of the problem OP by local search methods starting from x k.iffx k ε,gotostep 6. Step 2. Let Fx,x k,q= + x x k +qhfx fx k, 4 where ht is defined by. Set l=and u = 0.. Step 3. Consider a If l>k,setq := 0q,andgotoStep 5;otherwise,go to b. b If u λ,sety l k := x k +ue l, and go to c; otherwise, set l:=l+, u = 0., go to a. c If y l k X, go to d; otherwise, set u:=u/0,goto b. d If fy l k fx k /4, thensetx k+ := y l k, k:= k+, and go to Step ;otherwise,gotostep 4. Step 4. Search for a local minimizer of the following filled function problem starting from y l k : min x R n Fx,x k,q. 2 Once a point y k Xwith fy k fx k /4 is obtained in the process of searching, set x k+ := y k, k:= k+ and go to Step ; otherwise continue the process. Let x k be an obtained local minimizer of problem 2. If x k satisfies fx k fx k /4, then set x k+ := x k, k:=k+and go to Step ;otherwise,set u:=u/0,andgotostep 3b. Step 5. If q q U,gotoStep 2. Step 6. Let x s =x k and stop. In this algorithm, the termination criteria for minimization of Fx, x k,qin Step 4 can be interpreted as follows. The purpose of minimizing Fx, x k,qis to find a better point y k in set S 2 ={x:fx fx /4, x X}. If it is successful, that is, the solution obtained satisfies y k S 2,thenwecan turn to Step and restart to minimize the objective function with y k as a new starting point. If in the process of searching such point is not found, we can obtain the local minimizer x k of Fx, x k,q.bytheorems4 and 5, weknowthatthere must exist a local minimizer of Fx, x k,qwhich belongs to the set S 2 ={x:fx fx /4, x X}. Then,weturnto Step and minimizer fx starting from the local minimizer x k.obviously,ifλ is small enough, qu is large enough, and the direction set {e,...,e K } is large enough and x s can be obtained from algorithm FFOP within finite steps. 4. Numerical Experiment In this section, several sets of numerical experiments are presented to illustrate the efficiency of algorithm FFSNE. All the numerical experiments are implemented in Matlab200b. In our programs, the local minimizers of problem FFP and problem OP are obtained by the SQP method. Note that fx 0 6 is used as the terminate condition. The symbols used in Table 3 are given in Table. Throughout our computational experiments, the parameters in algorithm FFSNE are set as ε=0 8, λ = 0 5, q U := 0 20, q 0 := 0 0. Problem 9 test problem 4.. in [6]. Consider 4x 3 +4x x 2 +2x x 4=0, 4x x2 +4x x 2 26x 2 22=0, 5 x i 5, i=, Therearenineknownsolutionsasshownin[6]seeTable 2.
5 Applied Mathematics 5 Parameter k x 0 x k fx k Fx k Table Description The number of iterations in finding the kth local minimizer The initial point which satisfies x 0 X The kth local minimizer which we take as a solution or an approximate solution to SNE The function value of fx in finding the kth local minimizer The function value of Fx in finding the kth local minimizer Problem 0 test problem 4..2 in [6]. Consider x x 2 +x 3x 5 =0, Problem 3 test problem 4..5 in [6]. Consider 2x +x 2 +x 3 +x 4 +x 5 6=0, x +2x 2 +x 3 +x 4 +x 5 6=0, x +x 2 +2x 3 +x 4 +x 5 6=0, x +x 2 +x 3 +2x 4 +x 5 6=0, x x 2 x 3 x 4 x 5 =0 2 x i 2, i=,...,5. 8 The known solution is,,,, T and 0.96, 0.96, 0.96, 0.96,.48 T. Problem 4 test problem 4..6 in [6]. Consider 2x x 2 +x +3R 0 x 2 2 +x 2x 2 3 +R 7x 2 x 3 +R 9 x 2 x 4 +R 8 x 2 Rx 5 =0, 2x 2 x 2 3 +R 7x 2 x 3 +2R 5 x 2 3 +R 6x 3 8x 5 =0, R 9 x 2 x 4 +2x 2 4 4Rx 5 =0, x x 2 +x +R 0 x 2 2 +x 2x 2 3 +R 7x 2 x 3 +R 9 x 2 x x x x 2 x x +x x x = 0, x x x 2 x x x x x = 0, x 6 x x x 2 =0, +R 8 x 2 +R 5 x 2 3 +R 6x 3 +x 2 4 =0, x i 00, i =,...,5, x x = 0, x 2 +x2 2 =0, 9 where R = 0, R 5 = 0.93, R 6 = , R 7 = , R 8 = , R 9 = , and R 0 = The known solution in [6] is , , , , T. Problem test problem 4..3 in [6]. Consider 0 4 x x 2 =0, x 2 3 +x2 4 =0, x 2 5 +x2 6 =0, x 2 7 +x2 8 =0, x i, i=,...,8. The are sixteen known solutions of problem 6 are given in [6]. exp x +exp x 2.00 = 0, x 4.553, x The known solution is , T. 6 Problem 5 test problem in [7]. Consider 2x sin 4πx 2 x =0, x 2 0.5sin 2πx =0, 0 x, x Problem 2 test problem 4..4 in [6]. Consider The known solution is , T. 0.5 sin x x x 2 0.5x π =0, 0.25 π e2x e+ ex 2 π 2ex =0, 0.25 x,.5 x 2 2π. 7 The known solution is , T and 0.5, T. Problem 6 test problem 7 in [8]. Consider x 0.7 sin x 0.2 cos x 2 =0, x cos x +0.2sin x 2 =0, 00 x, x The known solution is , T. 2
6 6 Applied Mathematics Table 2 Sol x x Table 3: Computational results for Problems 9 6. Prob. Number x 0 k x k fx k Fx k The numerical results are listed in Table 3.FromTable 3, it is easy to see that all problems that we tested have been solved with a small number of iterations. 5. Conclusions In this paper, the filled function Fx, x,qwith one parameter is constructed for solving nonlinear equations and it has been proved that it satisfies the basic characteristics of the filled function definition. Promising computation results have been observed from our numerical experiments. In the future, the filled function method can be used to solve otherproblemssuchasnonlinearsystemsofequalitiesand inequalities and nonlinear feasibility problems with expensive functions. Conflict of Interests The authors declare that there is no conflict of interests regarding the publication of this paper. Acknowledgment This work was supported by the Natural Science Foundation of China no and no References [] S. Fucik and A. Kufner, Nonlinear Differential Equations, Scientific Publishing, New York, NY, USA, 2008.
7 Applied Mathematics 7 [2] X. Chen, L. Qi, and Y. F. Yang, Lagrangian globalization methods for nonlinear complementarity problems, Optimization Theory and Applications,vol.2,no.,pp.77 95, [3] C. Kanzow, Global optimization techniques for mixed complementarity problems, Global Optimization, vol. 6, no., pp. 2, [4] J. L. Nazareth and L. Qi, Globalization of Newton s methods for solving nonlinear equations, Numerical Linear Algebra with Applications,vol.3,pp ,996. [5] L. Qi and Y. F. Yang, NCP functions applied to Lagrangian globalization for the nonlinear complementarity problem, Global Optimization,vol.24,no.2,pp ,2002. [6] X. J. Tong, L. Qi, and Y. F. Yang, The Lagrangian globalization method for nonsmooth constrained equations, Computational Optimization and Applications,vol.33,no.,pp.89 09,2006. [7] A. V. Levy and A. Montalvo, The tunneling algorithm for the global minimization of functions, SIAM Journal on Scientific and Statistical Computing,vol.6,no.,pp.5 29,985. [8] R. P. Ge, A filled function method for finding a global minimizer of a function of several variables, Mathematical Programming,vol.46,no.2,pp.9 204,990. [9]Z.Y.Wu,M.Mammadov,F.S.Bai,andY.J.Yang, Afilled function method for nonlinear equations, Applied Mathematics and Computation,vol.89,no.2,pp ,2007. [0] Y. Lin, Y. J. Yang, and M. Mammadov, A new filled function method for nonlinear equations, Applied Mathematics and Computation,vol.20,no.2,pp.4 42,2009. [] Y. Lin and Y. Yang, Filled function method for nonlinear equations, Computational and Applied Mathematics, vol. 234, no. 3, pp , 200. [2]C.J.Wang,R.H.Luo,K.Wu,andB.S.Han, Anewfilled function method for an unconstrained nonlinear equation, Computational and Applied Mathematics,vol.235,no. 6, pp , 20. [3] Y. Lin and Y. Yang, A filled function method for box constrained nonlinear integer programming, the Korean Mathematical Society,vol.48,no.5,pp ,20. [4] L.Y.Yuan,Z.Wan,J.J.Zhang,andB.Sun, Afilledfunction method for solving nonlinear complementarity problem, Journal of Industrial and Management Optimization,vol.5,no.4,pp , [5] W. Zhu, Globally concavized filled function method for the box constrained continuous global minimization problem, Optimization Methods and Software,vol.2,no.4,pp , [6] C. A. Floudas, P. M. Pardalos, C. S. Adjiman et al., Handbook of Test Problems in Local and Global Optimization, vol. 33, Kluwer Academic, Dordrecht, The Netherland, 999. [7]L.S.Zhang,C.K.Ng,D.Li,andW.W.Tian, Anewfilled function method for global optimization, Global Optimization,vol.28,no.,pp.7 43,2004. [8] Y. Zhang and Z. H. Huang, A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities, Computational and Applied Mathematics,vol.233,no. 9, pp , 200.
8 Advances in Operations Research Advances in Decision Sciences Applied Mathematics Algebra Probability and Statistics The Scientific World Journal International Differential Equations Submit your manuscripts at International Advances in Combinatorics Mathematical Physics Complex Analysis International Mathematics and Mathematical Sciences Mathematical Problems in Engineering Mathematics Discrete Mathematics Discrete Dynamics in Nature and Society Function Spaces Abstract and Applied Analysis International Stochastic Analysis Optimization
Research Article Modified T-F Function Method for Finding Global Minimizer on Unconstrained Optimization
Mathematical Problems in Engineering Volume 2010, Article ID 602831, 11 pages doi:10.1155/2010/602831 Research Article Modified T-F Function Method for Finding Global Minimizer on Unconstrained Optimization
More informationResearch Article Identifying a Global Optimizer with Filled Function for Nonlinear Integer Programming
Discrete Dynamics in Nature and Society Volume 20, Article ID 7697, pages doi:0.55/20/7697 Research Article Identifying a Global Optimizer with Filled Function for Nonlinear Integer Programming Wei-Xiang
More informationA NOVEL FILLED FUNCTION METHOD FOR GLOBAL OPTIMIZATION. 1. Introduction Consider the following unconstrained programming problem:
J. Korean Math. Soc. 47, No. 6, pp. 53 67 DOI.434/JKMS..47.6.53 A NOVEL FILLED FUNCTION METHOD FOR GLOBAL OPTIMIZATION Youjiang Lin, Yongjian Yang, and Liansheng Zhang Abstract. This paper considers the
More informationResearch Article Finding Global Minima with a Filled Function Approach for Non-Smooth Global Optimization
Hindawi Publishing Corporation Discrete Dynamics in Nature and Society Volume 00, Article ID 843609, 0 pages doi:0.55/00/843609 Research Article Finding Global Minima with a Filled Function Approach for
More informationResearch Article Nonlinear Conjugate Gradient Methods with Wolfe Type Line Search
Abstract and Applied Analysis Volume 013, Article ID 74815, 5 pages http://dx.doi.org/10.1155/013/74815 Research Article Nonlinear Conjugate Gradient Methods with Wolfe Type Line Search Yuan-Yuan Chen
More informationA filled function method for finding a global minimizer on global integer optimization
Journal of Computational and Applied Mathematics 8 (2005) 200 20 www.elsevier.com/locate/cam A filled function method for finding a global minimizer on global integer optimization You-lin Shang a,b,,,
More informationResearch Article An Auxiliary Function Method for Global Minimization in Integer Programming
Mathematical Problems in Engineering Volume 2011, Article ID 402437, 13 pages doi:10.1155/2011/402437 Research Article An Auxiliary Function Method for Global Minimization in Integer Programming Hongwei
More informationA Filled Function Method with One Parameter for R n Constrained Global Optimization
A Filled Function Method with One Parameter for R n Constrained Global Optimization Weixiang Wang Youlin Shang Liansheng Zhang Abstract. For R n constrained global optimization problem, a new auxiliary
More informationResearch Article Remarks on the Regularity Criterion of the Navier-Stokes Equations with Nonlinear Damping
Mathematical Problems in Engineering Volume 15, Article ID 194, 5 pages http://dx.doi.org/1.1155/15/194 Research Article Remarks on the Regularity Criterion of the Navier-Stokes Equations with Nonlinear
More informationResearch Article A New Global Optimization Algorithm for Solving Generalized Geometric Programming
Mathematical Problems in Engineering Volume 2010, Article ID 346965, 12 pages doi:10.1155/2010/346965 Research Article A New Global Optimization Algorithm for Solving Generalized Geometric Programming
More informationResearch Article On a New Three-Step Class of Methods and Its Acceleration for Nonlinear Equations
e Scientific World Journal, Article ID 34673, 9 pages http://dx.doi.org/0.55/204/34673 Research Article On a New Three-Step Class of Methods and Its Acceleration for Nonlinear Equations T. Lotfi, K. Mahdiani,
More informationResearch Article Bessel Equation in the Semiunbounded Interval x [x 0, ]: Solving in the Neighbourhood of an Irregular Singular Point
International Mathematics and Mathematical Sciences Volume 2016, Article ID 6826482, 7 pages http://dx.doi.org/10.1155/2016/6826482 Research Article Bessel Equation in the Semiunbounded Interval x [x 0,
More informationResearch Article Solving the Matrix Nearness Problem in the Maximum Norm by Applying a Projection and Contraction Method
Advances in Operations Research Volume 01, Article ID 357954, 15 pages doi:10.1155/01/357954 Research Article Solving the Matrix Nearness Problem in the Maximum Norm by Applying a Projection and Contraction
More informationResearch Article Existence and Duality of Generalized ε-vector Equilibrium Problems
Applied Mathematics Volume 2012, Article ID 674512, 13 pages doi:10.1155/2012/674512 Research Article Existence and Duality of Generalized ε-vector Equilibrium Problems Hong-Yong Fu, Bin Dan, and Xiang-Yu
More informationA globally and R-linearly convergent hybrid HS and PRP method and its inexact version with applications
A globally and R-linearly convergent hybrid HS and PRP method and its inexact version with applications Weijun Zhou 28 October 20 Abstract A hybrid HS and PRP type conjugate gradient method for smooth
More informationResearch Article An Iterative Algorithm for the Split Equality and Multiple-Sets Split Equality Problem
Abstract and Applied Analysis, Article ID 60813, 5 pages http://dx.doi.org/10.1155/014/60813 Research Article An Iterative Algorithm for the Split Equality and Multiple-Sets Split Equality Problem Luoyi
More informationResearch Article A Novel Differential Evolution Invasive Weed Optimization Algorithm for Solving Nonlinear Equations Systems
Journal of Applied Mathematics Volume 2013, Article ID 757391, 18 pages http://dx.doi.org/10.1155/2013/757391 Research Article A Novel Differential Evolution Invasive Weed Optimization for Solving Nonlinear
More informationResearch Article Strong Convergence of a Projected Gradient Method
Applied Mathematics Volume 2012, Article ID 410137, 10 pages doi:10.1155/2012/410137 Research Article Strong Convergence of a Projected Gradient Method Shunhou Fan and Yonghong Yao Department of Mathematics,
More informationResearch Article A Characterization of E-Benson Proper Efficiency via Nonlinear Scalarization in Vector Optimization
Applied Mathematics, Article ID 649756, 5 pages http://dx.doi.org/10.1155/2014/649756 Research Article A Characterization of E-Benson Proper Efficiency via Nonlinear Scalarization in Vector Optimization
More informationResearch Article Existence of Periodic Positive Solutions for Abstract Difference Equations
Discrete Dynamics in Nature and Society Volume 2011, Article ID 870164, 7 pages doi:10.1155/2011/870164 Research Article Existence of Periodic Positive Solutions for Abstract Difference Equations Shugui
More informationResearch Article A Note on Optimality Conditions for DC Programs Involving Composite Functions
Abstract and Applied Analysis, Article ID 203467, 6 pages http://dx.doi.org/10.1155/2014/203467 Research Article A Note on Optimality Conditions for DC Programs Involving Composite Functions Xiang-Kai
More informationResearch Article A Note about the General Meromorphic Solutions of the Fisher Equation
Mathematical Problems in Engineering, Article ID 793834, 4 pages http://dx.doi.org/0.55/204/793834 Research Article A Note about the General Meromorphic Solutions of the Fisher Equation Jian-ming Qi, Qiu-hui
More information20 J.-S. CHEN, C.-H. KO AND X.-R. WU. : R 2 R is given by. Recently, the generalized Fischer-Burmeister function ϕ p : R2 R, which includes
016 0 J.-S. CHEN, C.-H. KO AND X.-R. WU whereas the natural residual function ϕ : R R is given by ϕ (a, b) = a (a b) + = min{a, b}. Recently, the generalized Fischer-Burmeister function ϕ p : R R, which
More informationResearch Article On New Wilker-Type Inequalities
International Scholarly Research Network ISRN Mathematical Analysis Volume 2011, Article ID 681702, 7 pages doi:10.5402/2011/681702 Research Article On New Wilker-Type Inequalities Zhengjie Sun and Ling
More informationResearch Article An Optimized Grey GM(2,1) Model and Forecasting of Highway Subgrade Settlement
Mathematical Problems in Engineering Volume 015, Article ID 606707, 6 pages http://dx.doi.org/10.1155/015/606707 Research Article An Optimized Grey GM(,1) Model and Forecasting of Highway Subgrade Settlement
More informationResearch Article On the System of Diophantine Equations
e Scientific World Journal, Article ID 63617, 4 pages http://dx.doi.org/1.1155/14/63617 Research Article On the System of Diophantine Equations x 6y = 5and x=az b Silan Zhang, 1, Jianhua Chen, 1 and Hao
More informationResearch Article Fourier Series of the Periodic Bernoulli and Euler Functions
Abstract and Applied Analysis, Article ID 85649, 4 pages http://dx.doi.org/.55/24/85649 Research Article Fourier Series of the Periodic Bernoulli and Euler Functions Cheon Seoung Ryoo, Hyuck In Kwon, 2
More informationResearch Article Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components
Applied Mathematics Volume 202, Article ID 689820, 3 pages doi:0.55/202/689820 Research Article Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components
More informationResearch Article Almost Sure Central Limit Theorem of Sample Quantiles
Advances in Decision Sciences Volume 202, Article ID 67942, 7 pages doi:0.55/202/67942 Research Article Almost Sure Central Limit Theorem of Sample Quantiles Yu Miao, Shoufang Xu, 2 and Ang Peng 3 College
More informationAlgorithms for constrained local optimization
Algorithms for constrained local optimization Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Algorithms for constrained local optimization p. Feasible direction methods Algorithms for constrained
More informationResearch Article An Inverse Eigenvalue Problem for Jacobi Matrices
Mathematical Problems in Engineering Volume 2011 Article ID 571781 11 pages doi:10.1155/2011/571781 Research Article An Inverse Eigenvalue Problem for Jacobi Matrices Zhengsheng Wang 1 and Baoiang Zhong
More informationResearch Article Asymptotic Behavior of the Solutions of System of Difference Equations of Exponential Form
Difference Equations Article ID 936302 6 pages http://dx.doi.org/10.1155/2014/936302 Research Article Asymptotic Behavior of the Solutions of System of Difference Equations of Exponential Form Vu Van Khuong
More informationResearch Article A Two-Grid Method for Finite Element Solutions of Nonlinear Parabolic Equations
Abstract and Applied Analysis Volume 212, Article ID 391918, 11 pages doi:1.1155/212/391918 Research Article A Two-Grid Method for Finite Element Solutions of Nonlinear Parabolic Equations Chuanjun Chen
More informationSolving Separable Nonlinear Equations Using LU Factorization
Western Washington University Western CEDAR Mathematics College of Science and Engineering 03 Solving Separable Nonlinear Equations Using LU Factorization Yun-Qiu Shen Western Washington University, yunqiu.shen@wwu.edu
More informationA Trust Region Algorithm Model With Radius Bounded Below for Minimization of Locally Lipschitzian Functions
The First International Symposium on Optimization and Systems Biology (OSB 07) Beijing, China, August 8 10, 2007 Copyright 2007 ORSC & APORC pp. 405 411 A Trust Region Algorithm Model With Radius Bounded
More informationResearch Article Uniqueness Theorems of Difference Operator on Entire Functions
Discrete Dynamics in Nature and Society Volume 203, Article ID 3649, 6 pages http://dx.doi.org/0.55/203/3649 Research Article Uniqueness Theorems of Difference Operator on Entire Functions Jie Ding School
More informationResearch Article Circle-Uniqueness of Pythagorean Orthogonality in Normed Linear Spaces
Function Spaces, Article ID 634842, 4 pages http://dx.doi.org/10.1155/2014/634842 Research Article Circle-Uniqueness of Pythagorean Orthogonality in Normed Linear Spaces Senlin Wu, Xinjian Dong, and Dan
More informationResearch Article Existence and Uniqueness of Homoclinic Solution for a Class of Nonlinear Second-Order Differential Equations
Applied Mathematics Volume 2012, Article ID 615303, 13 pages doi:10.1155/2012/615303 Research Article Existence and Uniqueness of Homoclinic Solution for a Class of Nonlinear Second-Order Differential
More informationResearch Article Uniqueness Theorems on Difference Monomials of Entire Functions
Abstract and Applied Analysis Volume 202, Article ID 40735, 8 pages doi:0.55/202/40735 Research Article Uniqueness Theorems on Difference Monomials of Entire Functions Gang Wang, Deng-li Han, 2 and Zhi-Tao
More informationResearch Article Fixed Point Theorems of Quasicontractions on Cone Metric Spaces with Banach Algebras
Abstract and Applied Analysis Volume 2013, Article ID 187348, 5 pages http://dx.doi.org/10.1155/2013/187348 Research Article Fixed Point Theorems of Quasicontractions on Cone Metric Spaces with Banach
More information1. Introduction The nonlinear complementarity problem (NCP) is to nd a point x 2 IR n such that hx; F (x)i = ; x 2 IR n + ; F (x) 2 IRn + ; where F is
New NCP-Functions and Their Properties 3 by Christian Kanzow y, Nobuo Yamashita z and Masao Fukushima z y University of Hamburg, Institute of Applied Mathematics, Bundesstrasse 55, D-2146 Hamburg, Germany,
More informationResearch Article Residual Iterative Method for Solving Absolute Value Equations
Abstract and Applied Analysis Volume 2012, Article ID 406232, 9 pages doi:10.1155/2012/406232 Research Article Residual Iterative Method for Solving Absolute Value Equations Muhammad Aslam Noor, 1 Javed
More informationResearch Article Global Attractivity of a Higher-Order Difference Equation
Discrete Dynamics in Nature and Society Volume 2012, Article ID 930410, 11 pages doi:10.1155/2012/930410 Research Article Global Attractivity of a Higher-Order Difference Equation R. Abo-Zeid Department
More informationMerit functions and error bounds for generalized variational inequalities
J. Math. Anal. Appl. 287 2003) 405 414 www.elsevier.com/locate/jmaa Merit functions and error bounds for generalized variational inequalities M.V. Solodov 1 Instituto de Matemática Pura e Aplicada, Estrada
More informationNonlinear Optimization: What s important?
Nonlinear Optimization: What s important? Julian Hall 10th May 2012 Convexity: convex problems A local minimizer is a global minimizer A solution of f (x) = 0 (stationary point) is a minimizer A global
More informationResearch Article New Oscillation Criteria for Second-Order Neutral Delay Differential Equations with Positive and Negative Coefficients
Abstract and Applied Analysis Volume 2010, Article ID 564068, 11 pages doi:10.1155/2010/564068 Research Article New Oscillation Criteria for Second-Order Neutral Delay Differential Equations with Positive
More informationSpectral gradient projection method for solving nonlinear monotone equations
Journal of Computational and Applied Mathematics 196 (2006) 478 484 www.elsevier.com/locate/cam Spectral gradient projection method for solving nonlinear monotone equations Li Zhang, Weijun Zhou Department
More informationResearch Article Hybrid Algorithm of Fixed Point for Weak Relatively Nonexpansive Multivalued Mappings and Applications
Abstract and Applied Analysis Volume 2012, Article ID 479438, 13 pages doi:10.1155/2012/479438 Research Article Hybrid Algorithm of Fixed Point for Weak Relatively Nonexpansive Multivalued Mappings and
More informationA new ane scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality constraints
Journal of Computational and Applied Mathematics 161 (003) 1 5 www.elsevier.com/locate/cam A new ane scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality
More informationResearch Article Optimality Conditions of Vector Set-Valued Optimization Problem Involving Relative Interior
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2011, Article ID 183297, 15 pages doi:10.1155/2011/183297 Research Article Optimality Conditions of Vector Set-Valued Optimization
More informationResearch Article Approximation Algorithm for a System of Pantograph Equations
Applied Mathematics Volume 01 Article ID 714681 9 pages doi:101155/01/714681 Research Article Approximation Algorithm for a System of Pantograph Equations Sabir Widatalla 1 and Mohammed Abdulai Koroma
More informationNewton-type Methods for Solving the Nonsmooth Equations with Finitely Many Maximum Functions
260 Journal of Advances in Applied Mathematics, Vol. 1, No. 4, October 2016 https://dx.doi.org/10.22606/jaam.2016.14006 Newton-type Methods for Solving the Nonsmooth Equations with Finitely Many Maximum
More informationA derivative-free nonmonotone line search and its application to the spectral residual method
IMA Journal of Numerical Analysis (2009) 29, 814 825 doi:10.1093/imanum/drn019 Advance Access publication on November 14, 2008 A derivative-free nonmonotone line search and its application to the spectral
More informationA New Approach for Solving Dual Fuzzy Nonlinear Equations Using Broyden's and Newton's Methods
From the SelectedWorks of Dr. Mohamed Waziri Yusuf August 24, 22 A New Approach for Solving Dual Fuzzy Nonlinear Equations Using Broyden's and Newton's Methods Mohammed Waziri Yusuf, Dr. Available at:
More informationResearch Article Design of PDC Controllers by Matrix Reversibility for Synchronization of Yin and Yang Chaotic Takagi-Sugeno Fuzzy Henon Maps
Abstract and Applied Analysis Volume 212, Article ID 35821, 11 pages doi:1.1155/212/35821 Research Article Design of PDC Controllers by Matrix Reversibility for Synchronization of Yin and Yang Chaotic
More informationAn improved generalized Newton method for absolute value equations
DOI 10.1186/s40064-016-2720-5 RESEARCH Open Access An improved generalized Newton method for absolute value equations Jingmei Feng 1,2* and Sanyang Liu 1 *Correspondence: fengjingmeilq@hotmail.com 1 School
More informationGENERALIZED second-order cone complementarity
Stochastic Generalized Complementarity Problems in Second-Order Cone: Box-Constrained Minimization Reformulation and Solving Methods Mei-Ju Luo and Yan Zhang Abstract In this paper, we reformulate the
More informationResearch Article Global Existence and Boundedness of Solutions to a Second-Order Nonlinear Differential System
Applied Mathematics Volume 212, Article ID 63783, 12 pages doi:1.1155/212/63783 Research Article Global Existence and Boundedness of Solutions to a Second-Order Nonlinear Differential System Changjian
More informationResearch Article Extended Precise Large Deviations of Random Sums in the Presence of END Structure and Consistent Variation
Applied Mathematics Volume 2012, Article ID 436531, 12 pages doi:10.1155/2012/436531 Research Article Extended Precise Large Deviations of Random Sums in the Presence of END Structure and Consistent Variation
More informationDepartment of Mathematics, College of Sciences, Shiraz University, Shiraz, Iran
Optimization Volume 2016, Article ID 9175371, 8 pages http://dx.doi.org/10.1155/2016/9175371 Research Article Finding the Efficiency Status and Efficient Projection in Multiobjective Linear Fractional
More informationResearch Article Sufficient Optimality and Sensitivity Analysis of a Parameterized Min-Max Programming
Applied Mathematics Volume 2012, Article ID 692325, 9 pages doi:10.1155/2012/692325 Research Article Sufficient Optimality and Sensitivity Analysis of a Parameterized Min-Max Programming Huijuan Xiong,
More informationResearch Article Merrifield-Simmons Index in Random Phenylene Chains and Random Hexagon Chains
Discrete Dynamics in Nature and Society Volume 015, Article ID 56896, 7 pages http://dx.doi.org/10.1155/015/56896 Research Article Merrifield-Simmons Index in Random Phenylene Chains and Random Hexagon
More informationResearch Article Solvability for a Coupled System of Fractional Integrodifferential Equations with m-point Boundary Conditions on the Half-Line
Abstract and Applied Analysis Volume 24, Article ID 29734, 7 pages http://dx.doi.org/.55/24/29734 Research Article Solvability for a Coupled System of Fractional Integrodifferential Equations with m-point
More informationResearch Article Applying GG-Convex Function to Hermite-Hadamard Inequalities Involving Hadamard Fractional Integrals
International Journal of Mathematics and Mathematical Sciences Volume 4, Article ID 3635, pages http://dx.doi.org/.55/4/3635 Research Article Applying GG-Convex Function to Hermite-Hadamard Inequalities
More informationResearch Article Particle Swarm Optimization-Proximal Point Algorithm for Nonlinear Complementarity Problems
Mathematical Problems in Engineering Volume 2013, Article ID 808965, 5 pages http://dx.doi.org/10.1155/2013/808965 Research Article Particle Swarm Optimization-Proximal Point Algorithm for Nonlinear Complementarity
More informationResearch Article Several New Third-Order and Fourth-Order Iterative Methods for Solving Nonlinear Equations
International Engineering Mathematics, Article ID 828409, 11 pages http://dx.doi.org/10.1155/2014/828409 Research Article Several New Third-Order and Fourth-Order Iterative Methods for Solving Nonlinear
More informationResearch Article Convergence Theorems for Infinite Family of Multivalued Quasi-Nonexpansive Mappings in Uniformly Convex Banach Spaces
Abstract and Applied Analysis Volume 2012, Article ID 435790, 6 pages doi:10.1155/2012/435790 Research Article Convergence Theorems for Infinite Family of Multivalued Quasi-Nonexpansive Mappings in Uniformly
More informationMultidisciplinary System Design Optimization (MSDO)
Multidisciplinary System Design Optimization (MSDO) Numerical Optimization II Lecture 8 Karen Willcox 1 Massachusetts Institute of Technology - Prof. de Weck and Prof. Willcox Today s Topics Sequential
More informationResearch Article Two Different Classes of Wronskian Conditions to a (3 + 1)-Dimensional Generalized Shallow Water Equation
International Scholarly Research Network ISRN Mathematical Analysis Volume 2012 Article ID 384906 10 pages doi:10.5402/2012/384906 Research Article Two Different Classes of Wronskian Conditions to a 3
More informationPenalty and Barrier Methods General classical constrained minimization problem minimize f(x) subject to g(x) 0 h(x) =0 Penalty methods are motivated by the desire to use unconstrained optimization techniques
More informationResearch Article Adaptive Control of Chaos in Chua s Circuit
Mathematical Problems in Engineering Volume 2011, Article ID 620946, 14 pages doi:10.1155/2011/620946 Research Article Adaptive Control of Chaos in Chua s Circuit Weiping Guo and Diantong Liu Institute
More informationMIT Manufacturing Systems Analysis Lecture 14-16
MIT 2.852 Manufacturing Systems Analysis Lecture 14-16 Line Optimization Stanley B. Gershwin Spring, 2007 Copyright c 2007 Stanley B. Gershwin. Line Design Given a process, find the best set of machines
More informationResearch Article Some Generalizations and Modifications of Iterative Methods for Solving Large Sparse Symmetric Indefinite Linear Systems
Abstract and Applied Analysis Article ID 237808 pages http://dxdoiorg/055/204/237808 Research Article Some Generalizations and Modifications of Iterative Methods for Solving Large Sparse Symmetric Indefinite
More informationResearch Article A Two-Step Matrix-Free Secant Method for Solving Large-Scale Systems of Nonlinear Equations
Applied Mathematics Volume 2012, Article ID 348654, 9 pages doi:10.1155/2012/348654 Research Article A Two-Step Matrix-Free Secant Method for Solving Large-Scale Systems of Nonlinear Equations M. Y. Waziri,
More informationCorrespondence should be addressed to Abasalt Bodaghi;
Function Spaces, Article ID 532463, 5 pages http://dx.doi.org/0.55/204/532463 Research Article Approximation on the Quadratic Reciprocal Functional Equation Abasalt Bodaghi and Sang Og Kim 2 Department
More informationGlobally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
Arab. J. Math. (2018) 7:289 301 https://doi.org/10.1007/s40065-018-0206-8 Arabian Journal of Mathematics Mompati S. Koorapetse P. Kaelo Globally convergent three-term conjugate gradient projection methods
More informationA Smoothing Newton Method for Solving Absolute Value Equations
A Smoothing Newton Method for Solving Absolute Value Equations Xiaoqin Jiang Department of public basic, Wuhan Yangtze Business University, Wuhan 430065, P.R. China 392875220@qq.com Abstract: In this paper,
More informationminimize x subject to (x 2)(x 4) u,
Math 6366/6367: Optimization and Variational Methods Sample Preliminary Exam Questions 1. Suppose that f : [, L] R is a C 2 -function with f () on (, L) and that you have explicit formulae for
More informationTHE solution of the absolute value equation (AVE) of
The nonlinear HSS-like iterative method for absolute value equations Mu-Zheng Zhu Member, IAENG, and Ya-E Qi arxiv:1403.7013v4 [math.na] 2 Jan 2018 Abstract Salkuyeh proposed the Picard-HSS iteration method
More informationResearch Article Stability Switches and Hopf Bifurcations in a Second-Order Complex Delay Equation
Hindawi Mathematical Problems in Engineering Volume 017, Article ID 679879, 4 pages https://doi.org/10.1155/017/679879 Research Article Stability Switches and Hopf Bifurcations in a Second-Order Complex
More informationResearch Article On a Quasi-Neutral Approximation to the Incompressible Euler Equations
Applied Mathematics Volume 2012, Article ID 957185, 8 pages doi:10.1155/2012/957185 Research Article On a Quasi-Neutral Approximation to the Incompressible Euler Equations Jianwei Yang and Zhitao Zhuang
More informationComplexity Analysis of Interior Point Algorithms for Non-Lipschitz and Nonconvex Minimization
Mathematical Programming manuscript No. (will be inserted by the editor) Complexity Analysis of Interior Point Algorithms for Non-Lipschitz and Nonconvex Minimization Wei Bian Xiaojun Chen Yinyu Ye July
More informationA Novel Inexact Smoothing Method for Second-Order Cone Complementarity Problems
A Novel Inexact Smoothing Method for Second-Order Cone Complementarity Problems Xiaoni Chi Guilin University of Electronic Technology School of Math & Comput Science Guilin Guangxi 541004 CHINA chixiaoni@126.com
More informationNew hybrid conjugate gradient methods with the generalized Wolfe line search
Xu and Kong SpringerPlus (016)5:881 DOI 10.1186/s40064-016-5-9 METHODOLOGY New hybrid conjugate gradient methods with the generalized Wolfe line search Open Access Xiao Xu * and Fan yu Kong *Correspondence:
More informationResearch Article The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity Problem
Journal of Applied Mathematics Volume 2012, Article ID 219478, 15 pages doi:10.1155/2012/219478 Research Article The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity
More informationResearch Article Some Results on Characterizations of Matrix Partial Orderings
Applied Mathematics, Article ID 408457, 6 pages http://dx.doi.org/10.1155/2014/408457 Research Article Some Results on Characterizations of Matrix Partial Orderings Hongxing Wang and Jin Xu Department
More informationMATH 4211/6211 Optimization Basics of Optimization Problems
MATH 4211/6211 Optimization Basics of Optimization Problems Xiaojing Ye Department of Mathematics & Statistics Georgia State University Xiaojing Ye, Math & Stat, Georgia State University 0 A standard minimization
More informationA class of Smoothing Method for Linear Second-Order Cone Programming
Columbia International Publishing Journal of Advanced Computing (13) 1: 9-4 doi:1776/jac1313 Research Article A class of Smoothing Method for Linear Second-Order Cone Programming Zhuqing Gui *, Zhibin
More informationResearch Article Two Optimal Eighth-Order Derivative-Free Classes of Iterative Methods
Abstract and Applied Analysis Volume 0, Article ID 3865, 4 pages doi:0.55/0/3865 Research Article Two Optimal Eighth-Order Derivative-Free Classes of Iterative Methods F. Soleymani and S. Shateyi Department
More informationFinite Convergence for Feasible Solution Sequence of Variational Inequality Problems
Mathematical and Computational Applications Article Finite Convergence for Feasible Solution Sequence of Variational Inequality Problems Wenling Zhao *, Ruyu Wang and Hongxiang Zhang School of Science,
More informationResearch Article The Dirichlet Problem on the Upper Half-Space
Abstract and Applied Analysis Volume 2012, Article ID 203096, 5 pages doi:10.1155/2012/203096 Research Article The Dirichlet Problem on the Upper Half-Space Jinjin Huang 1 and Lei Qiao 2 1 Department of
More informationResearch Article A Data Envelopment Analysis Approach to Supply Chain Efficiency
Advances in Decision Sciences Volume 2011, Article ID 608324, 8 pages doi:10.1155/2011/608324 Research Article A Data Envelopment Analysis Approach to Supply Chain Efficiency Alireza Amirteimoori and Leila
More informationE5295/5B5749 Convex optimization with engineering applications. Lecture 8. Smooth convex unconstrained and equality-constrained minimization
E5295/5B5749 Convex optimization with engineering applications Lecture 8 Smooth convex unconstrained and equality-constrained minimization A. Forsgren, KTH 1 Lecture 8 Convex optimization 2006/2007 Unconstrained
More informationCollege of Science, Inner Mongolia University of Technology, Hohhot, Inner Mongolia, China
Hindawi Mathematical Problems in Engineering Volume 07 Article ID 8704734 7 pages https://doiorg/055/07/8704734 Research Article Efficient Estimator of a Finite Population Mean Using Two Auxiliary Variables
More informationResearch Article Approximation of Analytic Functions by Bessel s Functions of Fractional Order
Abstract and Applied Analysis Volume 20, Article ID 923269, 3 pages doi:0.55/20/923269 Research Article Approximation of Analytic Functions by Bessel s Functions of Fractional Order Soon-Mo Jung Mathematics
More informationResearch Article A Matrix Method Based on the Fibonacci Polynomials to the Generalized Pantograph Equations with Functional Arguments
Advances in Mathematical Physics, Article ID 694580, 5 pages http://dx.doi.org/10.1155/2014/694580 Research Article A Matrix Method Based on the Fibonacci Polynomials to the Generalized Pantograph Equations
More informationStationary Points of Bound Constrained Minimization Reformulations of Complementarity Problems1,2
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS: Vol. 94, No. 2, pp. 449-467, AUGUST 1997 Stationary Points of Bound Constrained Minimization Reformulations of Complementarity Problems1,2 M. V. SOLODOV3
More informationResearch Article Diagonally Implicit Block Backward Differentiation Formulas for Solving Ordinary Differential Equations
International Mathematics and Mathematical Sciences Volume 212, Article ID 767328, 8 pages doi:1.1155/212/767328 Research Article Diagonally Implicit Block Backward Differentiation Formulas for Solving
More informationResearch Article Partial Pole Placement in LMI Region
Control Science and Engineering Article ID 84128 5 pages http://dxdoiorg/11155/214/84128 Research Article Partial Pole Placement in LMI Region Liuli Ou 1 Shaobo Han 2 Yongji Wang 1 Shuai Dong 1 and Lei
More informationShanming Wang, Ziguo Huang, Shujun Mu, and Xiangheng Wang. 1. Introduction
Mathematical Problems in Engineering Volume 215, Article ID 467856, 6 pages http://dx.doi.org/1.1155/215/467856 Research Article A Straightforward Convergence Method for ICCG Simulation of Multiloop and
More information