Continuity of the solution mapping to parametric generalized vector equilibrium problems

In this paper, two kinds of parametric generalized vector equilibrium problems in normed spaces are studied. The sufficient conditions for the continuity of the solution mappings to the two kinds of parametric generalized vector equilibrium problems are established under suitable conditions. The results presented in this paper extend and improve some main results in Chen and Gong (Pac J Optim 3:511–520, 2010), Chen and Li (Pac J Optim 6:141–152, 2010), Chen et al. (J Glob Optim 45:309–318, 2009), Cheng and Zhu (J Glob Optim 32:543–550, 2005), Gong (J Optim Theory Appl 139:35–46, 2008), Li and Fang (J Optim Theory Appl 147:507–515, 2010), Li et al. (Bull Aust Math Soc 81:85–95, 2010) and Peng et al. (J Optim Theory Appl 152(1):256–264, 2011).     

On the lower semicontinuity of the solution mappings to a parametric generalized strong vector equilibrium problem

In this paper, under new assumptions, which do not contain any information about the solution set, the lower semicontinuity of solution mappings to a parametric generalized strong vector equilibrium problem are established by using a scalarization method. These results extend and generalize the corresponding ones in Gong and Yao (J Optim Theory Appl 138:197–205, 2008), Chen and Li (Pac J Optim 6:141–151, 2010) and Li et al. (2012, submitted). Some examples are given to illustrate our results.     

Macroscopic Limits and Phase Transition in a System of Self-propelled Particles

We investigate systems of self-propelled particles with alignment interaction. Compared to previous work (Degond and Motsch, Math. Models Methods Appl. Sci. 18:1193–1215, 2008a; Frouvelle, Math. Models Methods Appl. Sci., 2012), the force acting on the particles is not normalized, and this modification gives rise to phase transitions from disordered states at low density to aligned states at high densities. This model is the space-inhomogeneous extension of (Frouvelle and Liu, Dynamics in a kinetic model of oriented particles with phase transition, 2012), in which the existence and stability of the equilibrium states were investigated. When the density is lower than a threshold value, the dynamics is described by a nonlinear diffusion equation. By contrast, when the density is larger than this threshold value, the dynamics is described by a similar hydrodynamic model for self-alignment interactions as derived in (Degond and Motsch, Math. Models Methods Appl. Sci. 18:1193–1215, 2008a; Frouvelle, Math. Models Methods Appl. Sci., 2012). However, the modified normalization of the force gives rise to different convection speeds, and the resulting model may lose its hyperbolicity in some regions of the state space.     

The weight distributions of a class of cyclic codes II

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases in Ding et al. (IEEE Trans Inform Theory 57(12), 8000–8006, 2011); Ma et al. (IEEE Trans Inform Theory 57(1):397–402, 2011); Wang et al. (Trans Inf Theory 58(12):7253–7259, 2012); and Xiong (Finite Fields Appl 18(5):933–945, 2012). In this paper we use the method developed in Xiong (Finite Fields Appl 18(5):933–945, 2012) to solve one more special case. We make extensive use of standard tools in number theory such as characters of finite fields, the Gauss sums and the Jacobi sums. The problem of finding the weight distribution is transformed into a problem of evaluating certain character sums over finite fields, which turns out to be associated with counting the number of points on some elliptic curves over finite fields. We also treat the special case that the characteristic of the finite field is 2.     

The strong convergence of a three-step algorithm for the split feasibility problem

Based on the very recent work by Dang and Gao (Invers Probl 27:1–9, 2011) and Wang and Xu (J Inequal Appl, doi:10.1155/2010/102085, 2010), and inspired by Yao (Appl Math Comput 186:1551–1558, 2007), Noor (J Math Anal Appl 251:217–229, 2000), and Xu (Invers Probl 22:2021–2034, 2006), we suggest a three-step KM-CQ-like method for solving the split common fixed-point problems in Hilbert spaces. Our results improve and develop previously discussed feasibility problem and related algorithms.     

Non-Decaying Solutions to the Navier Stokes Equations in Exterior Domains

We establish a new theorem of existence (and uniqueness) of solutions to the Navier-Stokes initial boundary value problem in exterior domains. No requirement is made on the convergence at infinity of the kinetic field and of the pressure field. These solutions are called non-decaying solutions. The first results on this topic dates back about 40 years ago see the references (Galdi and Rionero in Ann. Mat. Pures Appl. 108:361–366, 1976, Arch. Ration. Mech. Anal. 62:295–301, 1976, Arch. Ration. Mech. Anal. 69:37–52, 1979, Pac. J. Math. 104:77–83, 1980; Knightly in SIAM J. Math. Anal. 3:506–511, 1972). In the articles Galdi and Rionero (Ann. Mat. Pures Appl. 108:361–366, 1976, Arch. Ration. Mech. Anal. 62:295–301, 1976, Arch. Ration. Mech. Anal. 69:37–52, 1979, Pac. J. Math. 104:77–83, 1980) it was introduced the so called weight function method to study the uniqueness of solutions. More recently, the problem has been considered again by several authors (see Galdi et al. in J. Math. Fluid Mech. 14:633–652, 2012, Quad. Mat. 4:27–68, 1999, Nonlinear Anal. 47:4151–4156, 2001; Kato in Arch. Ration. Mech. Anal. 169:159–175, 2003; Kukavica and Vicol in J. Dyn. Differ. Equ. 20:719–732, 2008; Maremonti in Mat. Ves. 61:81–91, 2009, Appl. Anal. 90:125–139, 2011).     

Subdifferential and optimality conditions for the difference of set-valued mappings

In this paper, an existence theorem of the subgradients for set-valued mappings, which introduced by Borwein (Math Scand 48:189?C204, 1981), and relations between this subdifferential and the subdifferential introduced by Baier and Jahn (J Optim Theory Appl 100:233?C240, 1999), are obtained. By using the concept of this subdifferential, the sufficient optimality conditions for generalized D.C. multiobjective optimization problems are established. And the necessary optimality conditions, which are the generalizations of that in Gadhi (Positivity 9:687?C703, 2005), are also established. Moreover, by using a special scalarization function, a real set-valued optimization problem is introduced and the equivalent relations between the solutions are proved for the real set-valued optimization problem and a generalized D.C. multiobjective optimization problem.     

Minimax inequalities for set-valued mappings

In this paper, by using the finite intersection property, we first obtain two types of minimax inequalities for set-valued mappings, which improve and generalize the corresponding results in Ferro (J Optim Theory Appl 60:19?C31, 1989) and Li et?al. (J Math Anal Appl 281:707?C723, 2003). Then, by using the Ky Fan lemma and the Kakutani?CFan?CGlicksberg fixed point theorem, we also investigate some Ky Fan minimx inequalities for set-valued mappings.     

An improved local convergence analysis for a two-step Steffensen-type method

We study a class of Steffensen-type algorithm for solving nonsmooth variational inclusions in Banach spaces. We provide a local convergence analysis under ω-conditioned divided difference, and the Aubin continuity property. This work on the one hand extends the results on local convergence of Steffensen’s method related to the resolution of nonlinear equations (see Amat and Busquier in Comput. Math. Appl. 49:13–22, 2005; J. Math. Anal. Appl. 324:1084–1092, 2006; Argyros in Southwest J. Pure Appl. Math. 1:23–29, 1997; Nonlinear Anal. 62:179–194, 2005; J. Math. Anal. Appl. 322:146–157, 2006; Rev. Colomb. Math. 40:65–73, 2006; Computational Theory of Iterative Methods, 2007). On the other hand our approach improves the ratio of convergence and enlarges the convergence ball under weaker hypotheses than one given in Hilout (Commun. Appl. Nonlinear Anal. 14:27–34, 2007).     

Approximating common fixed points of non-self asymptotically nonexpansive mapping in Banach spaces

In this paper, we consider a composite iterative algorithm with errors for approximating a common fixed points of non-self asymptotically nonexpansive mappings in the framework of Hilbert spaces. Our results improve and extend Chidume et al. (J. Math. Anal. Appl. 280:364–374, [2003]), Shahzad (Nonlinear Anal. 61:1031–1039, [2005]), Su and Qin (J. Appl. Math. Comput. 24:437–448, [2007]) and many others.     

General convergence conditions of Newton’s method for m-Fréchet differentiable operators

We present a local as well as a semilocal convergence analysis for Newton’s method for approximating a locally unique solution of a nonlinear equation in a Banach space setting. Our hypotheses involve m-Fréchet-differentiable operators and general Lipschitz-type hypotheses, where m≥2 is a positive integer. The new convergence analysis unifies earlier results; it is more flexible and provides a finer convergence analysis than in earlier studies such as Argyros in J. Comput. Appl. Math. 131:149–159, 2001, Argyros and Hilout in J. Appl. Math. Comput. 29:391–400, 2009, Argyros and Hilout in J. Complex. 28:364–387, 2012, Argyros et al. Numerical Methods for Equations and Its Applications, CRC Press/Taylor & Francis, New York, 2012, Gutiérrez in J. Comput. Appl. Math. 79:131–145, 1997, Ren and Argyros in Appl. Math. Comput. 217:612–621, 2010, Traub and Wozniakowski in J. Assoc. Comput. Mech. 26:250–258, 1979. Numerical examples are presented further validating the theoretical results.     

Lower and upper Ginchev derivatives of vector functions and their applications to multiobjective optimization

Based on the definitions of lower and upper limits of vector functions introduced in Rahmo and Studniarski (J Math Anal Appl 393:212–221, 2012), we extend the lower and upper Ginchev directional derivatives to functions with values in finite-dimensional spaces where partial order is introduced by a polyhedral cone. This allows us to obtain some modifications of the optimality conditions from Luu (Higher-order optimality conditions in nonsmooth cone-constrained multiobjective programming. Institute of Mathematics, Hanoi, Vietnam 2008) with weakened assumptions on the minimized function.     

Directional Lipschitzness of Minimal Time Functions in Hausdorff Topological Vector Spaces

In a general Hausdorff topological vector space E, we associate to a given nonempty closed set S???E and a bounded closed set Ω???E, the minimal time function T _S,Ω defined by $T_{S,\Omega}(x):= \inf \{ t> 0: S\cap (x+t\Omega)\not = \emptyset\}$ . The study of this function has been the subject of various recent works (see Bounkhel (2012, submitted, 2013, accepted); Colombo and Wolenski (J Global Optim 28:269–282, 2004, J Convex Anal 11:335–361, 2004); He and Ng (J Math Anal Appl 321:896–910, 2006); Jiang and He (J Math Anal Appl 358:410–418, 2009); Mordukhovich and Nam (J Global Optim 46(4):615–633, 2010) and the references therein). The main objective of this work is in this vein. We characterize, for a given Ω, the class of all closed sets S in E for which T _S,Ω is directionally Lipschitz in the sense of Rockafellar (Proc Lond Math Soc 39:331–355, 1979). Those sets S are called Ω-epi-Lipschitz. This class of sets covers three important classes of sets: epi-Lipschitz sets introduced in Rockafellar (Proc Lond Math Soc 39:331–355, 1979), compactly epi-Lipschitz sets introduced in Borwein and Strojwas (Part I: Theory, Canad J Math No. 2:431–452, 1986), and K-directional Lipschitz sets introduced recently in Correa et al. (SIAM J Optim 20(4):1766–1785, 2010). Various characterizations of this class have been established. In particular, we characterize the Ω-epi-Lipschitz sets by the nonemptiness of a new tangent cone, called Ω-hypertangent cone. As for epi-Lipschitz sets in Rockafellar (Canad J Math 39:257–280, 1980) we characterize the new class of Ω-epi-Lipschitz sets with the help of other cones. The spacial case of closed convex sets is also studied. Our main results extend various existing results proved in Borwein et al. (J Convex Anal 7:375–393, 2000), Correa et al. (SIAM J Optim 20(4):1766–1785, 2010) from Banach spaces and normed spaces to Hausdorff topological vector spaces.     

Strong NP-hardness of scheduling problems with learning or aging effect

Proofs of strong NP-hardness of single machine and two-machine flowshop scheduling problems with learning or aging effect given in Rudek (Computers & Industrial Engineering 61:20–31, 2011; Annals of Operations Research 196(1):491–516, 2012a; International Journal of Advanced Manufacturing Technology 59:299–309, 2012b; Applied Mathematics and Computations 218:6498–6510, 2012c; Applied Mathematical Modelling 37:1523–1536, 2013) contain a common mistake that make them incomplete. We reveal the mistake and provide necessary corrections for the problems in Rudek (Computers & Industrial Engineering 61:20–31, 2011; Annals of Operations Research 196(1):491–516, 2012a; Applied Mathematical Modelling 37:1523–1536, 2013). NP-hardness of problems in Rudek (International Journal of Advanced Manufacturing Technology 59:299–309, 2012b; Applied Mathematics and Computations 218:6498–6510, 2012c) remains unknown because of another mistake which we are unable to correct.     

Convex sweeping process in the framework of measure differential inclusions and evolution variational inequalities

In this paper, we analyze and discuss the well-posedness of two new variants of the so-called sweeping process, introduced by Moreau in the early 70s (Moreau in Sém Anal Convexe Montpellier, 1971) with motivation in plasticity theory. The first new variant is concerned with the perturbation of the normal cone to the moving convex subset \(C(t)\) , supposed to have a bounded variation, by a Lipschitz mapping. Under some assumptions on the data, we show that the perturbed differential measure inclusion has one and only one right continuous solution with bounded variation. The second variant, for which a large analysis is made, concerns a first order sweeping process with velocity in the moving set \(C(t)\) . This class of problems subsumes as a particular case, the evolution variational inequalities [widely used in applied mathematics and unilateral mechanics (Duvaut and Lions in Inequalities in mechanics and physics. Springer, Berlin, 1976]. Assuming that the moving subset \(C(t)\) has a continuous variation for every \(t\in [0,T]\) with \(C(0)\) bounded, we show that the problem has at least a Lipschitz continuous solution. The well-posedness of this class of sweeping process is obtained under the coercivity assumption of the involved operator. We also discuss some applications of the sweeping process to the study of vector hysteresis operators in the elastoplastic model (Krej?? in Eur J Appl Math 2:281–292, 1991), to the planning procedure in mathematical economy (Henry in J Math Anal Appl 41:179–186, 1973 and Cornet in J. Math. Anal. Appl. 96:130–147, 1983), and to nonregular electrical circuits containing nonsmooth electronic devices like diodes (Acary et al. Nonsmooth modeling and simulation for switched circuits. Lecture notes in electrical engineering. Springer, New York 2011). The theoretical results are supported by some numerical simulations to prove the efficiency of the algorithm used in the existence proof. Our methodology is based only on tools from convex analysis. Like other papers in this collection, we show in this presentation how elegant modern convex analysis was influenced by Moreau’s seminal work.     

Convergence to extremal processes in random environments and extremal ageing in SK models

This paper extends recent results on ageing in mean field spin glasses on short time scales, obtained by Ben Arous and Gün (Commun Pure Appl Math 65:77–127, 2012) in law with respect to the environment, to results that hold almost surely, respectively in probability, with respect to the environment. It is based on the methods put forward in (Gayrard in Aging in reversible dynamics of disordered systems. II. Emergence of the arcsine law in the random hopping time dynamics of the REM, 2010; Electron J Probab 17(58): 1–33, 2012) and naturally complements (Bovier and Gayrard in Ann Probab, 2012).     

Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations

In this paper we present new concepts of efficiency for uncertain multi-objective optimization problems. We analyze the connection between the concept of minmax robust efficiency presented by Ehrgott et al. (Eur J Oper Res, 2014, doi:10.1016/j.ejor.2014.03.013) and the upper set less order relation \(\preceq _s^u\) introduced by Kuroiwa (1998, 1999). From this connection we derive new concepts of efficiency for uncertain multi-objective optimization problems by replacing the set ordering with other set orderings. Those are namely the lower set less ordering (see Kuroiwa 1998, 1999), the set less ordering (see Nishnianidze in Soobshch Akad Nauk Gruzin SSR 114(3):489–491, 1984; Young in Math Ann 104(1):260–290, 1931, doi:10.1007/BF01457934; Eichfelder and Jahn in Vector Optimization. Springer, Berlin, 2012), the certainly less ordering (see Eichfelder and Jahn in Vector Optimization. Springer, Berlin, 2012), and the alternative set less ordering (see Ide et al. in Fixed Point Theory Appl, 2014, doi:10.1186/1687-1812-2014-83; Köbis 2014). We analyze the resulting concepts of efficiency and present numerical results on the occurrence of the various concepts. We conclude the paper with a short comparison between the concepts, and an outlook to further work.     

On the Gauss–Newton method

We provide a new semilocal convergence analysis of the Gauss–Newton method (GNM) for solving nonlinear equation in the Euclidean space. Using a combination of center-Lipschitz, Lipschitz conditions, and our new idea of recurrent functions, we provide under the same or weaker hypotheses than before (Ben-Israel, J. Math. Anal. Appl. 15:243–252, 1966; Chen and Nashed, Numer. Math. 66:235–257, 1993; Deuflhard and Heindl, SIAM J. Numer. Anal. 16:1–10, 1979; Guo, J. Comput. Math. 25:231–242, 2007; Häußler, Numer. Math. 48:119–125, 1986; Hu et al., J. Comput. Appl. Math. 219:110–122, 2008; Kantorovich and Akilov, Functional Analysis in Normed Spaces, Pergamon, Oxford, 1982), a finer convergence analysis. The results can be extended in case outer or generalized inverses are used. Numerical examples are also provided to show that our results apply, where others fail (Ben-Israel, J. Math. Anal. Appl. 15:243–252, 1966; Chen and Nashed, Numer. Math. 66:235–257, 1993; Deuflhard and Heindl, SIAM J. Numer. Anal. 16:1–10, 1979; Guo, J. Comput. Math. 25:231–242, 2007; Häußler, Numer. Math. 48:119–125, 1986; Hu et al., J. Comput. Appl. Math. 219:110–122, 2008; Kantorovich and Akilov, Functional Analysis in Normed Spaces, Pergamon, Oxford, 1982).     

A Note on the Global Convergence of the Quadratic Hybridization of Polak–Ribière–Polyak and Fletcher–Reeves Conjugate Gradient Methods

A revision on condition (27) of Lemma 3.2 of Babaie-Kafaki (J. Optim. Theory Appl. 154(3):916–932, 2012) is made. Throughout, we use the same notation and equation numbers as in Babaie-Kafaki (J. Optim. Theory Appl. 154(3):916–932, 2012).     

On some characterizations of preinvex fuzzy mappings

Jeyakumar (Methods Oper. Res. 55:109–125, 1985) and Weir and Mond (J. Math. Anal. Appl. 136:29–38, 1988) introduced the concept of preinvex function. The preinvex functions have some interesting properties. For example, every local minimum of a preinvex function is a global minimum and nonnegative linear combinations of preinvex functions are preinvex. Invex functions were introduced by Hanson (J. Math. Anal. Appl. 80:545–550, 1981) as a generalization of differentiable convex functions. These functions are more general than the convex and pseudo convex ones. The type of invex function is equivalent to the type of function whose stationary points are global minima. Under some conditions, an invex function is also a preinvex function. Syau (Fuzzy Sets Syst. 115:455–461, 2000) introduced the concepts of pseudoconvexity, invexity, and pseudoinvexity for fuzzy mappings of one variable by using the notion of differentiability and the results proposed by Goestschel and Voxman (Fuzzy Sets Syst. 18:31–43, 1986). Wu and Xu (Fuzzy Sets Syst 159:2090–2103, 2008) introduced the concepts of fuzzy pseudoconvex, fuzzy invex, fuzzy pseudoinvex, and fuzzy preinvex mapping from \(\mathbb{R}^{n}\) to the set of fuzzy numbers based on the concept of differentiability of fuzzy mapping defined by Wang and Wu (Fuzzy Sets Syst. 138:559–591, 2003). In this paper, we present some characterizations of preinvex fuzzy mappings. The necessary and sufficient conditions for differentiable and twice differentiable preinvex fuzzy mapping are provided. These characterizations correct and improve previous results given by other authors. This fact is shown with examples. Moreover, we introduce additional conditions under which these results are valid.