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).     

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.     

Convergence of Pham Dinh–Le Thi’s algorithm for the trust-region subproblem

It is proved that any DCA sequence constructed by Pham Dinh–Le Thi’s algorithm for the trust-region subproblem (Pham Dinh and Le Thi, in SIAM J. Optim. 8:476–505, 1998) converges to a Karush–Kuhn–Tucker point of the problem. This result provides a complete solution for one open question raised by Le Thi et al. (J. Global Optim., Online First, doi:10.1007/s10898-011-9696-z, 2010).     

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).     

Some Sufficient Conditions for the Controllability of Wave Equations with Variable Coefficients

Motivated by Fu et al. (SIAM J. Control Optim. 46: 1578–1614, 2007), we present in this paper some ‘algebraic’ conditions that ensure the controllability of wave equations with non-constant coefficients. Compared with the ‘geometric’ conditions obtained in Yao (SIAM J. Control Optim. 37: 1568–1599, 1999), the conditions presented here are easier to be verified because only the first order derivatives of the coefficients are involved.     

A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei

In (Andrei, Comput. Optim. Appl. 38:402?C416, 2007), the efficient scaled conjugate gradient algorithm SCALCG is proposed for solving unconstrained optimization problems. However, due to a wrong inequality used in (Andrei, Comput. Optim. Appl. 38:402?C416, 2007) to show the sufficient descent property for the search directions of SCALCG, the proof of Theorem?2, the global convergence theorem of SCALCG, is incorrect. Here, in order to complete the proof of Theorem?2 in (Andrei, Comput. Optim. Appl. 38:402?C416, 2007), we show that the search directions of SCALCG satisfy the sufficient descent condition. It is remarkable that the convergence analyses in (Andrei, Optim. Methods Softw. 22:561?C571, 2007; Eur. J. Oper. Res. 204:410?C420, 2010) should be revised similarly.     

Multivariate Generalized Marshall–Olkin Distributions and Copulas

The multivariate generalized Marshall–Olkin distributions, which include the multivariate Marshall–Olkin exponential distribution due to Marshall and Olkin (J Am Stat Assoc 62:30–41, 1967) and multivariate Marshall–Olkin type distribution due to Muliere and Scarsini (Ann Inst Stat Math 39:429–441, 1987) as special cases, are studied in this paper. We derive the survival copula and the upper/lower orthant dependence coefficient, build the order of these survival copulas, and investigate the evolution of dependence of the residual life with respect to age. The main conclusions developed here are both nice extensions of the main results in Li (Commun Stat Theory Methods 37:1721–1733, 2008a, Methodol Comput Appl Probab 10:39–54, 2008b) and high dimensional generalizations of some results on the bivariate generalized Marshall–Olkin distributions in Li and Pellerey (J Multivar Anal 102:1399–1409, 2011).     

Approximation of rank function and its application to the nearest low-rank correlation matrix

The rank function rank(.) is neither continuous nor convex which brings much difficulty to the solution of rank minimization problems. In this paper, we provide a unified framework to construct the approximation functions of rank(.), and study their favorable properties. Particularly, with two families of approximation functions, we propose a convex relaxation method for the rank minimization problems with positive semidefinite cone constraints, and illustrate its application by computing the nearest low-rank correlation matrix. Numerical results indicate that this convex relaxation method is comparable with the sequential semismooth Newton method (Li and Qi in SIAM J Optim 21:1641–1666, 2011) and the majorized penalty approach (Gao and Sun, 2010) in terms of the quality of solutions.     

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).     

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).     

Gradient Estimates for the Porous Medium Equations on Riemannian Manifolds

In this paper we study gradient estimates for the positive solutions of the porous medium equation: $$u_t=\Delta u^m$$ where m>1, which is a nonlinear version of the heat equation. We derive local gradient estimates of the Li–Yau type for positive solutions of porous medium equations on Riemannian manifolds with Ricci curvature bounded from below. As applications, several parabolic Harnack inequalities are obtained. In particular, our results improve the ones of Lu, Ni, Vázquez, and Villani (in J. Math. Pures Appl. 91:1–19, 2009). Moreover, our results recover the ones of Davies (in Cambridge Tracts Math vol. 92, 1989), Hamilton (in Comm. Anal. Geom. 1:113–125, 1993) and Li and Xu (in Adv. Math. 226:4456–4491, 2011).     

Viscosity iterative scheme for generalized mixed equilibrium problems and nonexpansive semigroups

In this paper, we propose a new general iterative scheme based on the viscosity approximation method for finding a common element of the set of solutions of the generalized mixed equilibrium problem and the set of all common fixed points of a finite family of nonexpansive semigroups. Then, we prove the strong convergence of the iterative scheme to find a unique solution of the variational inequality that is the optimality condition for the minimization problem. Our results extend and improve some recent results of Cianciaruso et al. (J. Optim. Theory Appl. 146:491–509, 2010), Kamraksa and Wangkeeree (J. Glob. Optim. 51:689–714, 2011), and many others.     

Estimating upper bounds on the limit points of majorizing sequences for Newton’s method

We present new sufficient conditions for the semilocal convergence of Newton’s method to a locally unique solution of an equation in a Banach space setting. Upper bounds on the limit points of majorizing sequences are also given. Numerical examples are provided, where our new results compare favorably to earlier ones such as Argyros (J Math Anal Appl 298:374–397, 2004), Argyros and Hilout (J Comput Appl Math 234:2993-3006, 2010, 2011), Ortega and Rheinboldt (1970) and Potra and Pták (1984).     

A supplement to a regularization method for the proximal point algorithm

The purpose of this paper is to show that the iterative scheme recently studied by Xu (J Glob Optim 36(1):115–125, 2006) is the same as the one studied by Kamimura and Takahashi (J Approx Theory 106(2):226–240, 2000) and to give a supplement to these results. With the new technique proposed by Maingé (Comput Math Appl 59(1):74–79, 2010), we show that the convergence of the iterative scheme is established under another assumption. It is noted that if the computation error is zero or the approximate computation is exact, our new result is a genuine generalization of Xu’s result and Kamimura–Takahashi’s result.     

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.     

Speeding up branch and bound algorithms for solving the maximum clique problem

In this paper we consider two branch and bound algorithms for the maximum clique problem which demonstrate the best performance on DIMACS instances among the existing methods. These algorithms are MCS algorithm by Tomita et al. (2010) and MAXSAT algorithm by Li and Quan (2010a, b). We suggest a general approach which allows us to speed up considerably these branch and bound algorithms on hard instances. The idea is to apply a powerful heuristic for obtaining an initial solution of high quality. This solution is then used to prune branches in the main branch and bound algorithm. For this purpose we apply ILS heuristic by Andrade et al. (J Heuristics 18(4):525–547, 2012). The best results are obtained for p_hat1000-3 instance and gen instances with up to 11,000 times speedup.     

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.     

Constructive finite free resolutions

Northcott’s book Finite Free Resolutions (1976), as well as the paper (J. Reine Angew. Math. 262/263:205–219, 1973), present some key results of Buchsbaum and Eisenbud (J. Algebra 25:259–268, 1973; Adv. Math. 12: 84–139, 1974) both in a simplified way and without Noetherian hypotheses, using the notion of latent nonzero divisor introduced by Hochster. The goal of this paper is to simplify further the proofs of these results, which become now elementary in a logical sense (no use of prime ideals, or minimal prime ideals) and, we hope, more perspicuous. Some formulations are new and more general than in the references (J. Algebra 25:259–268, 1973; Adv. Math. 12: 84–139, 1974; Finite Free Resolutions 1976) (Theorem 7.2, Lemma 8.2 and Corollary 8.5).