Higher-order cone-pseudoconvex, quasiconvex and other related functions in vector optimization

Recently Bhatia (Optim. Lett. doi:10.1007/s11590-010-0248-0, 2010) introduced higher-order cone-convex functions and used them to obtain higher-order sufficient optimality conditions and duality results for a vector optimization problem over cones. The concepts of higher-order (strongly) cone-pseudoconvex and cone-quasiconvex functions were also defined by Bhatia (Optim. Lett. doi:10.1007/s11590-010-0248-0, 2010). In this paper we introduce the notions of higher-order naturally cone-pseudoconvex, strictly cone-pseudoconvex and weakly cone-quasiconvex functions and study various interrelations between the above mentioned functions. Higher-order sufficient optimality conditions have been established by using these functions. Generalized Mond–Weir type higher-order dual is formulated and various duality results have been established under the conditions of higher-order strongly cone-pseudoconvexity and higher-order cone quasiconvexity.     

Privacy-preserving horizontally partitioned linear programs with inequality constraints

In this paper we solve the open problem, finding the solutions for privacy-preserving horizontally partitioned linear programs with inequality constraints, proposed recently by Mangasarian (Optim Lett 2011, doi:10.1007/s11590-010-0268-9).     

Relaxation methods for solving linear inequality systems: converging results

The problem of finding a feasible solution to a linear inequality system arises in numerous contexts. In González-Gutiérrez and Todorov (Optim. Lett. doi:10.1007/s11590-010-0244-4, 2011), an algorithm, called extended relaxation method, for solving the feasibility problem has been proposed by the authors. Convergence of the algorithm has been proven. In this paper, we consider a class of extended relaxation methods depending on a parameter and prove their convergence. Numerical experiments have been provided, as well.     

An inference–proof approach to privacy-preserving horizontally partitioned linear programs

Mangasarian (Optim. Lett., 6(3), 431–436, 2012) proposed a constraints transformation based approach to securely solving the horizontally partitioned linear programs among multiple entities—every entity holds its own private equality constraints. More recently, Li et al. (Optim. Lett., doi:10.1007/s11590-011-0403-2, 2012) extended the transformation approach to horizontally partitioned linear programs with inequality constraints. However, such transformation approach is not sufficiently secure – occasionally, the privately owned constraints are still under high risk of inference. In this paper, we present an inference–proof algorithm to enhance the security for privacy-preserving horizontally partitioned linear program with arbitrary number of equality and inequality constraints. Our approach reveals significantly less information than the prior work and resolves the potential inference attack.     

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

The Local Langlands Correspondence for GL n over p-adic fields

We extend our methods from Scholze (Invent. Math. 2012, doi:10.1007/s00222-012-0419-y) to reprove the Local Langlands Correspondence for GL _n over p-adic fields as well as the existence of ?-adic Galois representations attached to (most) regular algebraic conjugate self-dual cuspidal automorphic representations, for which we prove a local-global compatibility statement as in the book of Harris-Taylor (The Geometry and Cohomology of Some Simple Shimura Varieties, 2001). In contrast to the proofs of the Local Langlands Correspondence given by Henniart (Invent. Math. 139(2), 439–455, 2000), and Harris-Taylor (The Geometry and Cohomology of Some Simple Shimura Varieties, 2001), our proof completely by-passes the numerical Local Langlands Correspondence of Henniart (Ann. Sci. Éc. Norm. Super. 21(4), 497–544, 1988). Instead, we make use of a previous result from Scholze (Invent. Math. 2012, doi:10.1007/s00222-012-0419-y) describing the inertia-invariant nearby cycles in certain regular situations.     

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.     

A note “On some primary subgroups and the structure of finite groups”

We point out an error in the paper (Monatsh Math. doi:10.1007/s00605-013-0492-3, 2013) by Kang, and give new brief proofs of the main results.     

Bilevel invex equilibrium problems with applications

In this paper, bilevel invex equilibrium problems of Hartman-Stampacchia type and Minty type [resp., in short, (HSBEP) and (MBEP)] are firstly introduced in finite Euclidean spaces. The relationships between (HSBEP) and (MBEP) are presented under some suitable conditions. By using fixed point technique, the nonemptiness and compactness of solution sets to (HSBEP) and (MBEP) are established under the invexity, respectively. As applications, we investigate the existence of solution and the behavior of solution set to the bilevel pseudomonotone variational inequalities of [Anh et al. J Glob Optim 2012, doi:10.1007/s10898-012-9870-y] and the solvability of minimization problem with variational inequality constraint.     

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.     

New examples of Willmore submanifolds in the unit sphere via isoparametric functions, II

This paper is a continuation and wide extension of (Ann. Glob. Anal. Geom., doi:10.1007/s10455-012-9319-z, 2012). In the first part of the present paper, we give a unified geometric proof that both focal submanifolds of every isoparametric hypersurface in spheres with four distinct principal curvatures are Willmore. In the second part, we completely determine which focal submanifolds are Einstein except one case.     

The multi-level Monte Carlo finite element method for a stochastic Brinkman Problem

We present the formulation and the numerical analysis of the Brinkman problem derived in Allaire (Arch Rational Mech Anal 113(3): 209–259,1990. doi:10.1007/BF00375065, Arch Rational Mech Anal 113(3): 261–298, 1990. doi:10.1007/BF00375066) with a lognormal random permeability. Specifically, the permeability is assumed to be a lognormal random field taking values in the symmetric matrices of size $d\times d$ , where $d$ denotes the spatial dimension of the physical domain $D$ . We prove that the solutions admit bounded moments of any finite order with respect to the random input’s Gaussian measure. We present a Mixed Finite Element discretization in the physical domain $D$ , which is uniformly stable with respect to the realization of the lognormal permeability field. Based on the error analysis of this mixed finite element method (MFEM), we develop a multi-level Monte Carlo (MLMC) discretization of the stochastic Brinkman problem and prove that the MLMC-MFEM allows the estimation of the statistical mean field with the same asymptotical accuracy versus work as the MFEM for a single instance of the stochastic Brinkman problem. The robustness of the MFEM implies in particular that the present analysis also covers the Darcy diffusion limit. Numerical experiments confirm the theoretical results.     

Remark on Itô’s Diffusion in Multidimensional Scattering with Sign-Indefinite Potentials

This paper extends some results of Denisov and Kupin (Int Math Res Not, doi:10.1093/imrn/rnr131, 2011) to the case of sign–indefinite potentials by applying methods developed in Denisov (J Funct Anal 254:2186–2226, 2008). This enables us to prove the presence of a.c. spectrum for the generic coupling constant.     

Admissible parameters of symmetric designs satisfying v=4(k-\lambda )+2 and symmetric designs with inner balance

The admissible parameters of symmetric \((v,k,\lambda )\) designs satisfying \(v=4(k-\lambda )+2\) are shown to correspond with the solutions of a certain Pell equation. We then determine the feasible parameters of such designs that could have a quasi-symmetric residual design with respect to a block, and classify them into two possible families. Finally, we consider the feasible parameters of symmetric designs with inner balance as defined by Nilson and Heidtmann (Des. Codes Cryptogr. doi:10.1007/s10623-012-9730-2, (2012)), and show that (with one exception) they must all belong to one of these families.     

Comparing perfect and 2nd Voronoi decompositions: the matroidal locus

We compare two rational polyhedral admissible decompositions of the cone of positive definite quadratic forms: the perfect cone decomposition and the 2nd Voronoi decomposition. We determine which cones belong to both the decompositions, thus providing a positive answer to a conjecture of Alexeev and Brunyate (Invent. Math. doi:10.1007/s00222-011-0347-2, 2011). As an application, we compare the two associated toroidal compactifications of the moduli space of principal polarized abelian varieties: the perfect cone compactification and the 2nd Voronoi compactification.     

Weyl modules and q-Whittaker functions

Let $G$ be a semi-simple simply connected group over $\mathbb {C}$ . Following Gerasimov et al. (Comm Math Phys 294:97–119, 2010) we use the $q$ -Toda integrable system obtained by quantum group version of the Kostant–Whittaker reduction (cf. Etingof in Am Math Soc Trans Ser 2:9–25, 1999, Sevostyanov in Commun Math Phys 204:1–16, 1999) to define the notion of $q$ -Whittaker functions $\varPsi _{\check{\lambda }}(q,z)$ . This is a family of invariant polynomials on the maximal torus $T\subset G$ (here $z\in T$ ) depending on a dominant weight $\check{\lambda }$ of $G$ whose coefficients are rational functions in a variable $q\in \mathbb {C}^*$ . For a conjecturally the same (but a priori different) definition of the $q$ -Toda system these functions were studied by Ion (Duke Math J 116:1–16, 2003) and by Cherednik (Int Math Res Notices 20:3793–3842, 2009) [we shall denote the $q$ -Whittaker functions from Cherednik (Int Math Res Notices 20:3793–3842, 2009) by $\varPsi '_{\check{\lambda }}(q,z)$ ]. For $G=SL(N)$ these functions were extensively studied in Gerasimov et al. (Comm Math Phys 294:97–119, 2010; Comm Math Phys 294:121–143, 2010; Lett Math Phys 97:1–24, 2011). We show that when $G$ is simply laced, the function $\hat{\varPsi }_{\check{\lambda }}(q,z)=\varPsi _{\check{\lambda }}(q,z)\cdot {\prod \nolimits _{i\in I}\prod \nolimits _{r=1}^{\langle \alpha _i,\check{\uplambda }\rangle }(1-q^r)}$ (here $I$ denotes the set of vertices of the Dynkin diagram of $G$ ) is equal to the character of a certain finite-dimensional $G[[{\mathsf {t}}]]\rtimes \mathbb {C}^*$ -module $D(\check{\lambda })$ (the Demazure module). When $G$ is not simply laced a twisted version of the above statement holds. This result is known for $\varPsi _{\check{\lambda }}$ replaced by $\varPsi '_{\check{\lambda }}$ (cf. Sanderson in J Algebraic Combin 11:269–275, 2000 and Ion in Duke Math J 116:1–16, 2003); however our proofs are algebro-geometric [and rely on our previous work (Braverman, Finkelberg in Semi-infinite Schubert varieties and quantum $K$ -theory of flag manifolds, arXiv/1111.2266, 2011)] and thus they are completely different from Sanderson (J Algebraic Combin 11:269–275, 2000) and Ion (Duke Math J 116:1–16, 2003) [in particular, we give an apparently new algebro-geometric interpretation of the modules $D(\check{\lambda })]$ .     

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

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.