A Robust Spectral Method for Solving Heston’s Model

In this paper, we consider the Heston’s volatility model (Heston in Rev. Financ. Stud. 6: 327–343, 1993]. We simulate this model using a combination of the spectral collocation method and the Laplace transforms method. To approximate the two dimensional PDE, we construct a grid which is the tensor product of the two grids, each of which is based on the Chebyshev points in the two spacial directions. The resulting semi-discrete problem is then solved by applying the Laplace transform method based on Talbot’s idea of deformation of the contour integral (Talbot in IMA J. Appl. Math. 23(1): 97–120, 1979).     

Irreversible investments with delayed reaction: an application to generation re-dispatch in power system operation

In this article we consider how the operator of an electric power system should activate bids on the regulating power market in order to minimize the expected operation cost. Important characteristics of the problem are reaction times of actors on the regulating market and ramp-rates for production changes in power plants. Neglecting these will in general lead to major underestimation of the operation cost. Including reaction times and ramp-rates leads to an impulse control problem with delayed reaction. Two numerical schemes to solve this problem are proposed. The first scheme is based on the least-squares Monte Carlo method developed by Longstaff and Schwartz (Rev Financ Stud 14:113–148, 2001). The second scheme which turns out to be more efficient when solving problems with delays, is based on the regression Monte Carlo method developed by Tsitsiklis and van Roy (IEEE Trans Autom Control 44(10):1840–1851, 1999) and (IEEE Trans Neural Netw 12(4):694–703, 2001). The main contribution of the article is the idea of using stochastic control to find an optimal strategy for power system operation and the numerical solution schemes proposed to solve impulse control problems with delayed reaction.     

State-space exact linearization and stabilization with feedback control in SODE economic models

The paper presents a non-conventional control engineering strategy proposed by experimental physicists, employed for controlling Dynamical Systems and basically designed for the control of nonlinear systems (Liqun and Yan Zhu in Appl. Math. Mech. 19:67–73, 1998; Liqun and Yan Zhu in Phys. Lett. A 262:350–354, 1999). After a brief presentation of the strategy—called state space exact linearization method, this is applied to design a nonlinear feedback control law as well as a modified version of this law, to control the Kaldor (Chang and Smyth in Rev. Econ. Stud. 38:37–44, 1971) and the Bonhoeffer-Van Der Pohl (Grassman in Environment, Economics and their Mathematical Models, 1994) nonlinear systems used in macro-economic business cycles.     

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

Improved Sobolev embeddings,profile decomposition,and concentration-compactness for fractional Sobolev spaces

We obtain an improved Sobolev inequality in \(\dot{H}^s\) spaces involving Morrey norms. This refinement yields a direct proof of the existence of optimizers and the compactness up to symmetry of optimizing sequences for the usual Sobolev embedding. More generally, it allows to derive an alternative, more transparent proof of the profile decomposition in \(\dot{H}^s\) obtained in Gérard (ESAIM Control Optim Calc Var 3:213–233, 1998) using the abstract approach of dislocation spaces developed in Tintarev and Fieseler (Concentration compactness. Functional-analytic grounds and applications. Imperial College Press, London, 2007). We also analyze directly the local defect of compactness of the Sobolev embedding in terms of measures in the spirit of Lions (Rev Mat Iberoamericana 1:145–201, 1985, Rev Mat Iberoamericana 1:45–121, 1985). As a model application, we study the asymptotic limit of a family of subcritical problems, obtaining concentration results for the corresponding optimizers which are well known when \(s\) is an integer (Rey in Manuscr Math 65:19–37, 1989, Han in Ann Inst Henri Poincaré Anal Non Linéaire 8:159–174, 1991, Chou and Geng in Differ Integral Equ 13:921–940, 2000).     

Efficient portfolios in financial markets with proportional transaction costs

In this article, we characterize efficient portfolios, i.e. portfolios which are optimal for at least one rational agent, in a very general multi-currency financial market model with proportional transaction costs. In our setting, transaction costs may be random, time-dependent, have jumps and the preferences of the agents are modeled by multivariate expected utility functions. We provide a complete characterization of efficient portfolios, generalizing earlier results of Dybvig (Rev Financ Stud 1:67–88, 1988) and Jouini and Kallal (J Econ Theory 66: 178–197, 1995). We basically show that a portfolio is efficient if and only if it is cyclically anticomonotonic with respect to at least one consistent price system that prices it. Finally, we introduce the notion of utility price of a given contingent claim as the minimal amount of a given initial portfolio allowing any agent to reach the claim by trading, and give a dual representation of it as the largest proportion of the market price necessary for all agents to reach the same expected utility level.     

Comparing first and second price auctions with asymmetric bidders

We study procurement auctions in which, as is common in practice, a group of sellers (incumbents, qualified bidders) is given an advantage, based, for example, on better reliability, quality, or incumbency status. We show conditions under which for any given first price handicap auction, there is a simple second-price design which dominates it. This generalizes a previous result for the case of an auction with one insider and one outsider (Mares and Swinkels in J Econ Theory, 2013) and sharpens our understanding of the classical result by Maskin and Riley (Rev Econ Stud 67:413–438, 2000).     

Liquidity-adjusted risk measures

Liquidity risk is an important type of risk, especially during times of crises. As observed by Acerbi and Scandolo (Quant Financ 8(7):681–691, 2008), it requires adjustments to classical portfolio valuation and risk measurement. Main drivers are two dimensions of liquidity risk, namely price impact of trades and limited access to financing. The key contribution of the current paper is the construction of a new, cash-invariant liquidity-adjusted risk measure that can naturally be interpreted as a capital requirement. We clarify the difference between our construction and the one of Acerbi and Scandolo (Quant Financ 8(7):681–691, 2008) in the framework of capital requirements using the notion of eligible assets, as introduced by Artzner et al. (Astin Bull 39(1):101–116, 2009). Numerical case studies illustrate how price impact and limited access to financing influence the liquidity-adjusted risk measurements.     

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.     

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

L p -theory for second-order elliptic operators with unbounded coefficients

Second-order elliptic operators with unbounded coefficients of the form ${Au := -{\rm div}(a\nabla u) + F . \nabla u + Vu}$ in ${L^{p}(\mathbb{R}^{N}) (N \in \mathbb{N}, 1 < p < \infty)}$ are considered, which are the same as in recent papers Metafune et?al. (Z Anal Anwendungen 24:497–521, 2005), Arendt et?al. (J Operator Theory 55:185–211, 2006; J Math Anal Appl 338: 505–517, 2008) and Metafune et?al. (Forum Math 22:583–601, 2010). A new criterion for the m-accretivity and m-sectoriality of A in ${L^{p}(\mathbb{R}^{N})}$ is presented via a certain identity that behaves like a sesquilinear form over L ^p ×?L ^p'. It partially improves the results in (Metafune et?al. in Z Anal Anwendungen 24:497–521, 2005) and (Metafune et?al. in Forum Math 22:583–601, 2010) with a different approach. The result naturally extends Kato’s criterion in (Kato in Math Stud 55:253–266, 1981) for the nonnegative selfadjointness to the case of p ≠?2. The simplicity is illustrated with the typical example ${Au = -u\hspace{1pt}'' + x^{3}u\hspace{1pt}' + c |x|^{\gamma}u}$ in ${L^p(\mathbb{R})}$ which is dealt with in (Arendt et?al. in J Operator Theory 55:185–211, 2006; Arendt et?al. in J Math Anal Appl 338: 505–517, 2008).     

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

Immersed Solutions of Plateau’s Problem for Piecewise Smooth Boundary Curves with Small Total Curvature

We provide a new proof of the classical result that any closed rectifiable Jordan curve ${\Gamma \subset \mathbb{R}^3}$ being piecewise of class C ² bounds at least one immersed minimal surface of disc-type, under the additional assumption that the total curvature of Γ is smaller than 6π. In contrast to the methods due to Osserman (Ann Math 91(2):550–569, 1970), Gulliver (Ann Math 97(2):275–305, 1973) and Alt (Math Z 127:333–362, 1972, Math Ann 201:33–35, 1973), our proof relies on a polygonal approximation technique, using the existence of immersed solutions of Plateau’s problem for polygonal boundary curves, provided by the first author’s accomplishment (The Plateau problem, Fuchsian equations and the Riemann–Hilbert problem. Mémoires de la Soc. Math. Fr. (to appear) arXiv: 1003.0978) of Garnier’s ideas in (Annales scientifiques de l’É.N.S. 45:53–144, 1928).     

On Ulm’s method for Fréchet differentiable operators

We provide new sufficient convergence conditions for the semilocal convergence of Ulm’s method (Izv. Akad. Nauk Est. SSR 16:403–411, 1967) in order to approximate a locally unique solution of an equation in a Banach space setting. We show that in some cases, our hypotheses hold true but the corresponding ones (Burmeister in Z. Angew. Math. Mech. 52:101–110, 1972; Kornstaedt in Aequ. Math. 13:21–45, 1975; Petzeltova in Comment. Math. Univ. Carol. 21:719–725, 1980; Potra and Ptǎk in Cas. Pest. Mat. 108:333–341, 1983; Ulm in Izv. Akad. Nauk Est. SSR 16:403–411, 1967) do not. We also show that under the same hypotheses and computational cost as (Burmeister in Z. Angew. Math. Mech. 52:101–110, 1972; Kornstaedt in Aequ. Math. 13:21–45, 1975; Petzeltova in Comment. Math. Univ. Carol. 21:719–725, 1980; Potra and Ptǎk in Cas. Pest. Mat. 108:333–341, 1983; Ulm in Izv. Akad. Nauk Est. SSR 16:403–411, 1967) finer error sequences can be obtained. Numerical examples are also provided further validating the results.     

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

An augmented Lagrangian approach for sparse principal component analysis

Principal component analysis (PCA) is a widely used technique for data analysis and dimension reduction with numerous applications in science and engineering. However, the standard PCA suffers from the fact that the principal components (PCs) are usually linear combinations of all the original variables, and it is thus often difficult to interpret the PCs. To alleviate this drawback, various sparse PCA approaches were proposed in the literature (Cadima and Jolliffe in J Appl Stat 22:203–214, 1995; d’Aspremont et?al. in J Mach Learn Res 9:1269–1294, 2008; d’Aspremont et?al. SIAM Rev 49:434–448, 2007; Jolliffe in J Appl Stat 22:29–35, 1995; Journée et?al. in J Mach Learn Res 11:517–553, 2010; Jolliffe et?al. in J Comput Graph Stat 12:531–547, 2003; Moghaddam et?al. in Advances in neural information processing systems 18:915–922, MIT Press, Cambridge, 2006; Shen and Huang in J Multivar Anal 99(6):1015–1034, 2008; Zou et?al. in J Comput Graph Stat 15(2):265–286, 2006). Despite success in achieving sparsity, some important properties enjoyed by the standard PCA are lost in these methods such as uncorrelation of PCs and orthogonality of loading vectors. Also, the total explained variance that they attempt to maximize can be too optimistic. In this paper we propose a new formulation for sparse PCA, aiming at finding sparse and nearly uncorrelated PCs with orthogonal loading vectors while explaining as much of the total variance as possible. We also develop a novel augmented Lagrangian method for solving a class of nonsmooth constrained optimization problems, which is well suited for our formulation of sparse PCA. We show that it converges to a feasible point, and moreover under some regularity assumptions, it converges to a stationary point. Additionally, we propose two nonmonotone gradient methods for solving the augmented Lagrangian subproblems, and establish their global and local convergence. Finally, we compare our sparse PCA approach with several existing methods on synthetic (Zou et?al. in J Comput Graph Stat 15(2):265–286, 2006), Pitprops (Jeffers in Appl Stat 16:225–236, 1967), and gene expression data (Chin et?al in Cancer Cell 10:529C–541C, 2006), respectively. The computational results demonstrate that the sparse PCs produced by our approach substantially outperform those by other methods in terms of total explained variance, correlation of PCs, and orthogonality of loading vectors. Moreover, the experiments on random data show that our method is capable of solving large-scale problems within a reasonable amount of time.     

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.     

Optimal Transport, Convection, Magnetic Relaxation and Generalized Boussinesq Equations

We establish a connection between optimal transport theory (see Villani in Topics in optimal transportation. Graduate studies in mathematics, vol. 58, AMS, Providence, 2003, for instance) and classical convection theory for geophysical flows (Pedlosky, in Geophysical fluid dynamics, Springer, New York, 1979). Our starting point is the model designed few years ago by Angenent, Haker, and Tannenbaum (SIAM J. Math. Anal. 35:61–97, 2003) to solve some optimal transport problems. This model can be seen as a generalization of the Darcy–Boussinesq equations, which is a degenerate version of the Navier–Stokes–Boussinesq (NSB) equations. In a unified framework, we relate different variants of the NSB equations (in particular what we call the generalized hydrostatic-Boussinesq equations) to various models involving optimal transport (and the related Monge–Ampère equation, Brenier in Commun. Pure Appl. Math. 64:375–417, 1991; Caffarelli in Commun. Pure Appl. Math. 45:1141–1151, 1992). This includes the 2D semi-geostrophic equations (Hoskins in Annual review of fluid mechanics, vol. 14, pp. 131–151, Palo Alto, 1982; Cullen et al. in SIAM J. Appl. Math. 51:20–31, 1991, Arch. Ration. Mech. Anal. 185:341–363, 2007; Benamou and Brenier in SIAM J. Appl. Math. 58:1450–1461, 1998; Loeper in SIAM J. Math. Anal. 38:795–823, 2006) and some fully nonlinear versions of the so-called high-field limit of the Vlasov–Poisson system (Nieto et al. in Arch. Ration. Mech. Anal. 158:29–59, 2001) and of the Keller–Segel for Chemotaxis (Keller and Segel in J. Theor. Biol. 30:225–234, 1971; Jäger and Luckhaus in Trans. Am. Math. Soc. 329:819–824, 1992; Chalub et al. in Mon. Math. 142:123–141, 2004). Mathematically speaking, we establish some existence theorems for local smooth, global smooth or global weak solutions of the different models. We also justify that the inertia terms can be rigorously neglected under appropriate scaling assumptions in the generalized Navier–Stokes–Boussinesq equations. Finally, we show how a “stringy” generalization of the AHT model can be related to the magnetic relaxation model studied by Arnold and Moffatt to obtain stationary solutions of the Euler equations with prescribed topology (see Arnold and Khesin in Topological methods in hydrodynamics. Applied mathematical sciences, vol. 125, Springer, Berlin, 1998; Moffatt in J. Fluid Mech. 159:359–378, 1985, Topological aspects of the dynamics of fluids and plasmas. NATO adv. sci. inst. ser. E, appl. sci., vol. 218, Kluwer, Dordrecht, 1992; Schonbek in Theory of the Navier–Stokes equations, Ser. adv. math. appl. sci., vol. 47, pp. 179–184, World Sci., Singapore, 1998; Vladimirov et al. in J. Fluid Mech. 390:127–150, 1999; Nishiyama in Bull. Inst. Math. Acad. Sin. (N.S.) 2:139–154, 2007).     

A new approach to the description of one-parameter groups of formal power series in one indeterminate

The aim of the paper is to describe one-parameter groups of formal power series, that is to find a general form of all homomorphisms \({\Theta_G : G \to \Gamma}\) , \({\Theta_G(t) = \sum_{k=1}^{\infty} c_k(t)X^k}\) , \({c_1 : G \to \mathbb{K} \setminus\{0\}}\) , \({c_k : G \to \mathbb{K}}\) for k ≥ 2, from a commutative group (G, + ) into the group \({(\Gamma, \circ)}\) of invertible formal power series with coefficients in \({\mathbb{K} \in \{\mathbb{R},\mathbb{C}\}}\) . Considering one-parameter groups of formal power series and one-parameter groups of truncated formal power series, we give explicit formulas for the coefficient functions c _k with more details in the case where either c ₁ = 1 or c ₁ takes infinitely many values. Here we give the results much more simply than they were presented in Jab?oński and Reich (Abh. Math. Sem. Univ. Hamburg 75:179–201, 2005; Result Math 47:61–68, 2005; Publ Math Debrecen 73(1–2):25–47, 2008). Also the case im c ₁ = E _m (here E _m stands for the group of all complex roots of order m of 1), not considered in Jab?oński and Reich (Abh. Math. Sem. Univ. Hamburg 75:179–201, 2005; Result Math 47:61–68, 2005; Publ Math Debrecen 73(1–2):25–47, 2008), will be discussed.     

Tilting Theory and Functor Categories I. Classical Tilting

Tilting theory has been a very important tool in the classification of finite dimensional algebras of finite and tame representation type, as well as, in many other branches of mathematics. Happel (1988) and Cline et al. (J Algebra 304:397–409 1986) proved that generalized tilting induces derived equivalences between module categories, and tilting complexes were used by Rickard (J Lond Math Soc 39:436–456, 1989) to develop a general Morita theory of derived categories. On the other hand, functor categories were introduced in representation theory by Auslander (I Commun Algebra 1(3):177–268, 1974), Auslander (1971) and used in his proof of the first Brauer–Thrall conjecture (Auslander 1978) and later on, used systematically in his joint work with I. Reiten on stable equivalence (Auslander and Reiten, Adv Math 12(3):306–366, 1974), Auslander and Reiten (1973) and many other applications. Recently, functor categories were used in Martínez-Villa and Solberg (J Algebra 323(5):1369–1407, 2010) to study the Auslander–Reiten components of finite dimensional algebras. The aim of this paper is to extend tilting theory to arbitrary functor categories, having in mind applications to the functor category Mod (mod_Λ), with Λ a finite dimensional algebra.