Local convergence and the dynamics of a two-point four parameter Jarratt-like method under weak conditions

We present a local convergence analysis of a two-point four parameter Jarratt-like method of high convergence order in order to approximate a locally unique solution of a nonlinear equation. In contrast to earlier studies such us (Amat et al. Aequat. Math. 69(3), 212–223 2015; Amat et al. J. Math. Anal. Appl. 366(3), 24–32 2010; Behl, R. 2013; Bruns and Bailey Chem. Eng. Sci. 32, 257–264 1977; Candela and Marquina. Computing 44, 169–184 1990; Candela and Marquina. Computing 45(4), 355–367 1990; Chun. Appl. Math. Comput. 190(2), 1432–1437 2007; Cordero and Torregrosa. Appl. Math. Comput. 190, 686–698 2007; Deghan. Comput. Appl Math. 29(1), 19–30 2010; Deghan. Comput. Math. Math. Phys. 51(4), 513–519 2011; Deghan and Masoud. Eng. Comput. 29(4), 356–365 15; Cordero and Torregrosa. Appl. Math. Comput. 190, 686–698 2012; Deghan and Masoud. Eng. Comput. 29(4), 356–365 2012; Ezquerro and Hernández. Appl. Math. Optim. 41(2), 227–236 2000; Ezquerro and Hernández. BIT Numer. Math. 49, 325–342 2009; Ezquerro and Hernández. J. Math. Anal. Appl. 303, 591–601 2005; Gutiérrez and Hernández. Comput. Math. Appl. 36(7), 1–8 1998; Ganesh and Joshi. IMA J. Numer. Anal. 11, 21–31 1991; González-Crespo et al. Expert Syst. Appl. 40(18), 7381–7390 2013; Hernández. Comput. Math. Appl. 41(3-4), 433–455 2001; Hernández and Salanova. Southwest J. Pure Appl. Math. 1, 29–40 1999; Jarratt. Math. Comput. 20(95), 434–437 1966; Kou and Li. Appl. Math. Comput. 189, 1816–1821 2007; Kou and Wang. Numer. Algor. 60, 369–390 2012; Lorenzo et al. Int. J. Interact. Multimed. Artif. Intell. 1(3), 60–66 2010; Magreñán. Appl. Math. Comput. 233, 29–38 2014; Magreñán. Appl. Math. Comput. 248, 215–224 2014; Parhi and Gupta. J. Comput. Appl. Math. 206(2), 873–887 2007; Rall 1979; Ren et al. Numer. Algor. 52(4), 585–603 2009; Rheinboldt Pol. Acad. Sci. Banach Ctr. Publ. 3, 129–142 1978; Sicilia et al. J. Comput. Appl. Math. 291, 468–477 2016; Traub 1964; Wang et al. Numer. Algor. 57, 441–456 2011) using hypotheses up to the fifth derivative, our sufficient convergence conditions involve only hypotheses on the first Fréchet-derivative of the operator involved. The dynamics of the family for choices of the parameters such that it is optimal is also shown. Numerical examples are also provided in this study     

Speed of Vertex-Reinforced Jump Process on Galton–Watson Trees

We give an alternative proof of the fact that the vertex-reinforced jump process on Galton–Watson tree has a phase transition between recurrence and transience as a function of \(c\), the initial local time, see Basdevant et al. (Ann Appl Probab 22(4):1728–1743, 2012). Further, applying techniques in Aidékon (Probab Theory Relat Fields 142(3–4):525–559, 2008), we show a phase transition between positive speed and null speed for the associated discrete-time process in the transient regime.     

Improved local convergence analysis of the Gauss–Newton method under a majorant condition

We present a local convergence analysis of Gauss-Newton method for solving nonlinear least square problems. Using more precise majorant conditions than in earlier studies such as Chen (Comput Optim Appl 40:97–118, 2008), Chen and Li (Appl Math Comput 170:686–705, 2005), Chen and Li (Appl Math Comput 324:1381–1394, 2006), Ferreira (J Comput Appl Math 235:1515–1522, 2011), Ferreira and Gonçalves (Comput Optim Appl 48:1–21, 2011), Ferreira and Gonçalves (J Complex 27(1):111–125, 2011), Li et al. (J Complex 26:268–295, 2010), Li et al. (Comput Optim Appl 47:1057–1067, 2004), Proinov (J Complex 25:38–62, 2009), Ewing, Gross, Martin (eds.) (The merging of disciplines: new directions in pure, applied and computational mathematics 185–196, 1986), Traup (Iterative methods for the solution of equations, 1964), Wang (J Numer Anal 20:123–134, 2000), we provide a larger radius of convergence; tighter error estimates on the distances involved and a clearer relationship between the majorant function and the associated least squares problem. Moreover, these advantages are obtained under the same computational cost.     

Twisting the Alive Particle Filter

This work focuses on sampling from hidden Markov models (Cappe et al. 2005) whose observations have intractable density functions. We develop a new sequential Monte Carlo (e.g. Doucet, 2011) algorithm and a new particle marginal Metropolis-Hastings (Andrieu et al J R Statist Soc Ser B 72:269-342, 2010) algorithm for these purposes. We build from Jasra et al (2013) and Whiteley and Lee (Ann Statist 42:115-141, 2014) to construct the sequential Monte Carlo (SMC) algorithm, which we call the alive twisted particle filter. Like the alive particle filter (Amrein and Künsch, 2011, Jasra et al, 2013), our new SMC algorithm adopts an approximate Bayesian computation (Tavare et al. Genetics 145:505-518, 1997) estimate of the HMM. Our alive twisted particle filter also uses a twisted proposal as in Whiteley and Lee (Ann Statist 42:115-141, 2014) to obtain a low-variance estimate of the HMM normalising constant. We demonstrate via numerical examples that, in some scenarios, this estimate has a much lower variance than that of the estimate obtained via the alive particle filter. The low variance of this normalising constant estimate encourages the implementation of our SMC algorithm within a particle marginal Metropolis-Hastings (PMMH) scheme, and we call the resulting methodology “alive twisted PMMH”. We numerically demonstrate, on a stochastic volatility model, how our alive twisted PMMH can converge faster than the standard alive PMMH of Jasra et al (2013).     

Extensions of the Noncommutative Integration

In this paper we will continue the analysis undertaken in Bagarello et al. (Rend Circ Mat Palermo (2) 55:21–28, 2006), Bongiorno et al. (Rocky Mt J Math 40(6):1745–1777, 2010), Triolo (Rend Circ Mat Palermo (2) 60(3):409–416, 2011) on the general problem of extending the noncommutative integration in a *-algebra of measurable operators. As in Aiena et al. (Filomat 28(2):263–273, 2014), Bagarello (Stud Math 172(3):289–305, 2006) and Bagarello et al. (Rend Circ Mat Palermo (2) 55:21–28, 2006), the main problem is to represent different types of partial *-algebras into a *-algebra of measurable operators in Segal’s sense, provided that these partial *-algebras posses a sufficient family of positive linear functionals (states) (Fragoulopoulou et al., J Math Anal Appl 388(2):1180–1193, 2012; Trapani and Triolo, Stud Math 184(2):133–148, 2008; Trapani and Triolo, Rend Circolo Mat Palermo 59:295–302, 2010; La Russa and Triolo, J Oper Theory, 69:2, 2013; Triolo, J Pure Appl Math, 43(6):601–617, 2012). In this paper, a new condition is given in an attempt to provide a extension of the non commutative integration.     

A brief note on the coarea formula

In this note we consider a special case of the famous Coarea Formula whose initial proof (for functions from any Riemannian manifold of dimension 2 into \({\mathbb {R}}\)) is due to Kronrod (Uspechi Matem Nauk 5(1):24–134, 1950) and whose general proof (for Lipschitz maps between two Riemannian manifolds of dimensions n and p) is due to Federer (Am Math Soc 93:418–491, 1959). See also Maly et al. (Trans Am Math Soc 355(2):477–492, 2002), Fleming and Rishel (Arch Math 11(1):218–222, 1960) and references therein for further generalizations to Sobolev mappings and BV functions respectively. We propose two counterexamples which prove that the coarea formula that we can find in many references (for example Bérard (Spectral geometry: direct and inverse problems, Springer, 1987), Berger et al. (Le Spectre d’une Variété Riemannienne, Springer, 1971) and Gallot (Astérisque 163(164):31–91, 1988), is not valid when applied to \(C^\infty \) functions. The gap appears only for the non generic set of non Morse functions.     

Law of Large Numbers for Branching Symmetric Hunt Processes with Measure-Valued Branching Rates

We establish weak and strong laws of large numbers for a class of branching symmetric Hunt processes with the branching rate being a smooth measure with respect to the underlying Hunt process, and the branching mechanism being general and state dependent. Our work is motivated by recent work on the strong law of large numbers for branching symmetric Markov processes by Chen and Shiozawa (J Funct Anal 250:374–399, 2007) and for branching diffusions by Engländer et al. (Ann Inst Henri Poincaré Probab Stat 46:279–298, 2010). Our results can be applied to some interesting examples that are covered by neither of these papers.     

Condition Length and Complexity for the Solution of Polynomial Systems

Smale’s 17th problem asks for an algorithm which finds an approximate zero of polynomial systems in average polynomial time (see Smale in Mathematical problems for the next century, American Mathematical Society, Providence, 2000). The main progress on Smale’s problem is Beltrán and Pardo (Found Comput Math 11(1):95–129, 2011) and Bürgisser and Cucker (Ann Math 174(3):1785–1836, 2011). In this paper, we will improve on both approaches and prove an interesting intermediate result on the average value of the condition number. Our main results are Theorem 1 on the complexity of a randomized algorithm which improves the result of Beltrán and Pardo (2011), Theorem 2 on the average of the condition number of polynomial systems which improves the estimate found in Bürgisser and Cucker (2011), and Theorem 3 on the complexity of finding a single zero of polynomial systems. This last theorem is similar to the main result of Bürgisser and Cucker (2011) but relies only on homotopy methods, thus removing the need for the elimination theory methods used in Bürgisser and Cucker (2011). We build on methods developed in Armentano et al. (2014).     

Complex Outliers of Hermitian Random Matrices

In this paper, we study the asymptotic behavior of the outliers of the sum a Hermitian random matrix and a finite rank matrix which is not necessarily Hermitian. We observe several possible convergence rates and outliers locating around their limits at the vertices of regular polygons as in Benaych-Georges and Rochet (Probab Theory Relat Fields, 2015), as well as possible correlations between outliers at macroscopic distance as in Knowles and Yin (Ann Probab 42(5):1980–2031, 2014) and Benaych-Georges and Rochet (2015). We also observe that a single spike can generate several outliers in the spectrum of the deformed model, as already noticed in Benaych-Georges and Nadakuditi (Adv Math 227(1):494–521, 2011) and Belinschi et al. (Outliers in the spectrum of large deformed unitarily invariant models 2012, arXiv:1207.5443v1). In the particular case where the perturbation matrix is Hermitian, our results complete the work of Benaych-Georges et al. (Electron J Probab 16(60):1621–1662, 2011), as we consider fluctuations of outliers lying in “holes” of the limit support, which happen to exhibit surprising correlations.     

Finite time blow up for a solution to system of the drift–diffusion equations in higher dimensions

We discuss the existence of a blow-up solution for a multi-component parabolic–elliptic drift–diffusion model in higher space dimensions. We show that the local existence, uniqueness and well-posedness of a solution in the weighted \(L^2\) spaces. Moreover we prove that if the initial data satisfies certain conditions, then the corresponding solution blows up in a finite time. This is a system case for the blow up result of the chemotactic and drift–diffusion equation proved by Nagai (J Inequal Appl 6:37–55, 2001) and Nagai et al. (Hiroshima J Math 30:463–497, 2000) and gravitational interaction of particles by Biler (Colloq Math 68:229–239, 1995), Biler and Nadzieja (Colloq Math 66:319–334, 1994, Adv Differ Equ 3:177–197, 1998). We generalize the result in Kurokiba and Ogawa (Differ Integral Equ 16:427–452, 2003, Differ Integral Equ 28:441–472, 2015) and Kurokiba (Differ Integral Equ 27(5–6):425–446, 2014) for the multi-component problem and give a sufficient condition for the finite time blow up of the solution. The condition is different from the one obtained by Corrias et al. (Milan J Math 72:1–28, 2004).     

Fast convergence of an inexact interior point method for horizontal complementarity problems

In Andreani et al. (Numer. Algorithms 57:457–485, 2011), an interior point method for the horizontal nonlinear complementarity problem was introduced. This method was based on inexact Newton directions and safeguarding projected gradient iterations. Global convergence, in the sense that every cluster point is stationary, was proved in Andreani et al. (Numer. Algorithms 57:457–485, 2011). In Andreani et al. (Eur. J. Oper. Res. 249:41–54, 2016), local fast convergence was proved for the underdetermined problem in the case that the Newtonian directions are computed exactly. In the present paper, it will be proved that the method introduced in Andreani et al. (Numer. Algorithms 57:457–485, 2011) enjoys fast (linear, superlinear, or quadratic) convergence in the case of truly inexact Newton computations. Some numerical experiments will illustrate the accuracy of the convergence theory.     

Optimal software-implemented Itoh–Tsujii inversion for $$\mathbb {F}_{2^{m}}$$

Field inversion in \(\mathbb {F}_{2^{m}}\) dominates the cost of modern software implementations of certain elliptic curve cryptographic operations, such as point encoding/hashing into elliptic curves (Brown et al. in: Submission to NIST, 2008; Brown in: IACR Cryptology ePrint Archive 2008:12, 2008; Aranha et al. in: Cryptology ePrint Archive, Report 2014/486, 2014) Itoh–Tsujii inversion using a polynomial basis and precomputed table-based multi-squaring has been demonstrated to be highly effective for software implementations (Taverne et al. in: CHES 2011, 2011; Oliveira et al. in: J Cryptogr Eng 4(1):3–17, 2014; Aranha et al. in: Cryptology ePrint Archive, Report 2014/486, 2014), but the performance and memory use depend critically on the choice of addition chain and multi-squaring tables, which in prior work have been determined only by suboptimal ad-hoc methods and manual selection. We thoroughly investigated the performance/memory tradeoff for table-based linear transforms used for efficient multi-squaring. Based upon the results of that investigation, we devised a comprehensive cost model for Itoh–Tsujii inversion and a corresponding optimization procedure that is empirically fast and provably finds globally-optimal solutions. We tested this method on eight binary fields commonly used for elliptic curve cryptography; our method found lower-cost solutions than the ad-hoc methods used previously, and for the first time enables a principled exploration of the time/memory tradeoff of inversion implementations.     

The Markov Additive Risk Process Under an Erlangized Dividend Barrier Strategy

In this paper, we consider a Markov additive insurance risk process under a randomized dividend strategy in the spirit of Albrecher et al. (2011). Decisions on whether to pay dividends are only made at a sequence of dividend decision time points whose intervals are Erlang(n) distributed. At a dividend decision time, if the surplus level is larger than a predetermined dividend barrier, then the excess is paid as a dividend as long as ruin has not occurred. In contrast to Albrecher et al. (2011), it is assumed that the event of ruin is monitored continuously (Avanzi et al. (2013) and Zhang (2014)), i.e. the surplus process is stopped immediately once it drops below zero. The quantities of our interest include the Gerber-Shiu expected discounted penalty function and the expected present value of dividends paid until ruin. Solutions are derived with the use of Markov renewal equations. Numerical examples are given, and the optimal dividend barrier is identified in some cases.     

A contribution to perturbation analysis for total least squares problems

In this note, we present perturbation analysis for the total least squares (Tls) problems under the genericity condition. We review the three condition numbers proposed respectively by Zhou et al. (Numer. Algorithm, 51 (2009), pp. 381–399), Baboulin and Gratton (SIAM J. Matrix Anal. Appl. 32 (2011), pp. 685–699), Li and Jia (Linear Algebra Appl. 435 (2011), pp. 674–686). We also derive new perturbation bounds.     

Liouville-type theorems for nonlinear degenerate parabolic equation

We study Liouville-type theorems for degenerate parabolic equation of the form \({u_t-{\rm div}(|\nabla u|^{m-2}\nabla u) = u^p}\) where \({m > 2}\) and \({p > m - 1}\). We prove the optimal Liouville-type results in dimension \({N = 1}\), and for radial solutions in any dimension. We also provide some partial results for non-radial solutions in dimension \({N \geq 2}\). Our proofs are based on a generalized Gidas–Spruck technique, combined with the idea of Serrin and Zou (Acta Math 189(1):79–142, 2002) and of Bidaut-Véron (Équations aux dérivées partielles et applications. Elsevier, Paris, pp 189–198, 1998). Finally, we clarify and correct some of the previous results on this topic.     

A Neyman–Pearson problem with ambiguity and nonlinear pricing

We consider a problem of the Neyman–Pearson type arising in the theory of portfolio choice in the presence of probability weighting, such as in markets with Choquet pricing (as in Araujo et al. in Econ Theory 49(1):1–35, 2011; Cerreia-Vioglio et al. in J Econ Theory 157(1):730–762, 2015; Chateauneuf and Cornet in Submodular financial markets with frictions. Working Paper, 2015; Chateauneuf et al. in Math Finance 6(3):323–330, 1996) and ambiguous beliefs about the payoffs of contingent claims (see Gilboa and Marinacci, in: Acemoglu, Arellano, Dekel (eds) Advances in economics and econometrics: theory and applications, tenth world congress of the econometric society, Cambridge University Press, Cambridge, 2013). Specifically, we consider a problem of optimal choice of a contingent claim so as to minimize a non-linear pricing functional (or a distortion risk measure), subject to a minimum expected performance measure (or a minimum expected return or utility), where expectations with respect to distorted probabilities are taken in the sense of Choquet. Such contingent claims are called cost-efficient. We give an analytical characterization of cost-efficient contingent claims under very mild assumptions on the probability weighting functions, thereby extending some of the results of Ghossoub (Math Financ Econ 10(1):87–111, 2016), and we provide examples of some special cases of interest. In particular, we show how a cost-efficient contingent claim exhibits a desirable monotonicity property: It is anti-comonotonic with the random mark-to-market value (or return, etc.) of the underlying financial position, and it is hence a hedge against such variability.     

Robust return risk measures

In this paper we provide an axiomatic foundation to Orlicz risk measures in terms of properties of their acceptance sets, by exploiting their natural correspondence with shortfall risk Föllmer and Schied (Stochastic finance. De Gruyter, Berlin, 2011), thus paralleling the characterization in Weber (Math Financ 16:419–442, 2006). From a financial point of view, Orlicz risk measures assess the stochastic nature of returns, in contrast to the common use of risk measures to assess the stochastic nature of a position’s monetary value. The correspondence with shortfall risk leads to several robustified versions of Orlicz risk measures, and of their optimized translation invariant extensions (Rockafellar and Uryasev in J Risk 2:21–42, 2000, Goovaerts et al. in Insur Math Econ 34:505–516, 2004), arising from an ambiguity averse approach as in Gilboa and Schmeidler (J Math Econ 18:141–153, 1989), Maccheroni et al. (Econometrica 74:1447–1498, 2006), Chateauneuf and Faro (J Math Econ 45:535–558, 2010), or from a multiplicity of Young functions. We study the properties of these robust Orlicz risk measures, derive their dual representations, and provide some examples and applications.     

Performance of convex underestimators in a branch-and-bound framework

The efficient determination of tight lower bounds in a branch-and-bound algorithm is crucial for the global optimization of models spanning numerous applications and fields. The global optimization method \(\alpha \)-branch-and-bound (\(\alpha \)BB, Adjiman et al. in Comput Chem Eng 22(9):1159–1179, 1998b, Comput Chem Eng 22(9):1137–1158, 1998a; Adjiman and Floudas in J Global Optim 9(1):23–40, 1996; Androulakis et al. J Global Optim 7(4):337–363, 1995; Floudas in Deterministic Global Optimization: Theory, Methods and Applications, vol. 37. Springer, Berlin, 2000; Maranas and Floudas in J Chem Phys 97(10):7667–7678, 1992, J Chem Phys 100(2):1247–1261, 1994a, J Global Optim 4(2):135–170, 1994), guarantees a global optimum with \(\epsilon \)-convergence for any \(\mathcal {C}^2\)-continuous function within a finite number of iterations via fathoming nodes of a branch-and-bound tree. We explored the performance of the \(\alpha \)BB method and a number of competing methods designed to provide tight, convex underestimators, including the piecewise (Meyer and Floudas in J Global Optim 32(2):221–258, 2005), generalized (Akrotirianakis and Floudas in J Global Optim 30(4):367–390, 2004a, J Global Optim 29(3):249–264, 2004b), and nondiagonal (Skjäl et al. in J Optim Theory Appl 154(2):462–490, 2012) \(\alpha \)BB methods, the Brauer and Rohn+E (Skjäl et al. in J Global Optim 58(3):411–427, 2014) \(\alpha \)BB methods, and the moment method (Lasserre and Thanh in J Global Optim 56(1):1–25, 2013). Using a test suite of 40 multivariate, box-constrained, nonconvex functions, the methods were compared based on the tightness of generated underestimators and the efficiency of convergence of a branch-and-bound global optimization algorithm.     

On the Semicircular Law of Large-Dimensional Random Quaternion Matrices

It is well known that the Gaussian symplectic ensemble is defined on the space of \(n\times n\) quaternion self-dual Hermitian matrices with Gaussian random elements. There is a huge body of literature regarding this kind of matrices based on the exact known form of the density function of the eigenvalues (see Erd?s in Russ Math Surv 66(3):507–626, 2011; Erd?s in Probab Theory Relat Fields 154(1–2):341–407, 2012; Erd?s et al. in Adv Math 229(3):1435–1515, 2012; Knowles and Yin in Probab Theory Relat Fields, 155(3–4):543–582, 2013; Tao and Vu in Acta Math 206(1):127–204, 2011; Tao and Vu in Electron J Probab 16(77):2104–2121, 2011). Due to the fact that multiplication of quaternions is not commutative, few works about large-dimensional quaternion self-dual Hermitian matrices are seen without normality assumptions. As in natural, we shall get more universal results by removing the Gaussian condition. For the first step, in this paper, we prove that the empirical spectral distribution of the common quaternion self-dual Hermitian matrices tends to the semicircular law. The main tool to establish the universal result is given as a lemma in this paper as well.     

A simple proof of Olatinwo’s theorems

In this paper we provide a simple proof of the existence coupled fixed point theorem in complete cone metric spaces due to Sabetghadam et al. (Fixed Point Theory Appl 2009:8, 2009) and due to Olatinwo (Annali Dell’Universita’Di Ferrara 57:173–180, 2011). In particular we prove that these results are spacial cases of Rezapour and Hamlbarani’s theorems (J Math Anal Appl 345(2):719–724, 2008).