Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods

Many challenging problems in automatic control may be cast as optimization programs subject to matrix inequality constraints. Here we investigate an approach which converts such problems into non-convex eigenvalue optimization programs and makes them amenable to non-smooth analysis techniques like bundle or cutting plane methods. We prove global convergence of a first-order bundle method for programs with non-convex maximum eigenvalue functions. Dedicated to R. T. Rockafellar on the occasion of his 70th anniversary     

Local solvability of the -equation with boundary regularity on weakly q-convex domains

We consider weakly q-convex domains with smooth boundary and show that the -equation is locally solvable with regularity up to the boundary for smooth forms of degree (p,s) for s≥q.     

-measures for branching exit Markov systems and their applications to differential equations

Semilinear equations Lu=(u) where L is an elliptic differential operator and is a positive function can be investigated by using (L,)-superdiffusions. In a special case u=u² a powerful probabilistic tool – the Brownian snake – introduced by Le Gall was successfully applied by him and his school to get deep results on solutions of this equation. Some of these results (but not all of them) were extended by Dynkin and Kuznetsov to general equations by applying superprocesses. An important role in the theory of the Brownian snake and its applications is played by measures _x on the space of continuous paths. Our goal is to introduce analogous measures related to superprocesses (and to general branching exit Markov systems). They are defined on the space of measures and we call them -measures. Using -measures allows to combine some advantages of Brownian snakes and of superprocesses as tools for a study of semilinear PDEs.Partially supported by National Science Foundation Grant DMS-0204237 and DMS-9971009Mathematics Subject Classification (2000): Primary 31C15, Secondary 35J65, 60J60     

Remarks on convex cones

We point out in this note that the class of cones in a locally convex topological vector space satisfying property () or piecewise relatively weakly compact cones is exactly the class of cones admitting weakly compact bases or the class of cones whose closures admit weakly compact bases.This work was supported by a Monash University Postdoctoral Fellowship.     

What is so special with the powerset operation?

The powerset operator, , is an operator which (1) sends sets to sets,(2) is defined by a positive formula and (3) raises the cardinality of its argument, i.e., |(x)|>|x|. As a consequence of (3), has a proper class as least fixed point (the universe itself). In this paper we address the questions: (a) How does contribute to the generation of the class of all positive operators? (b) Are there other operators with the above properties, independent of ? Concerning (a) we show that every positive operator is a combination of the identity, powerset, and almost constant operators. This enables one to define what a -independent operator is. Concerning (b) we show that every -independent bounded positive operator is not -like.Mathematics Subject Classification (2000): Primary 03E05, secondary 03E20     

Topological existence and stability for stackelberg problems

The aim of this paper is to study, in a topological framework, existence and stability for the solutions to a parametrized Stackelberg problem. To this end, approximate solutions are used, more precisely, -solutions and strict -solutions. The results given are of minimal character and the standard types of constraints are considered, that is, constant constraints, constraints defined by a finite number of inequalities, and more generally constraints defined by an arbitrary multifunction.     

Duality gap in convex programming

In this paper, we consider general convex programming problems and give a sufficient condition for the equality of the infimum of the original problem and the supremum of its ordinary dual. This condition may be seen as a continuity assumption on the constraint sets (i.e. on the sublevel sets of the constraint function) under linear perturbation. It allows us to generalize as well as treat previous results in a unified framework. Our main result is in fact based on a quite general constraint qualification result for quasiconvex programs involving a convex objective function proven in the setting of a real normed vector space.Mathematics Subject Classification (2000):90C25, 90C26, 90C30, 90C31     

(φ,ξ,η,λ)‐Structures of Parabolic Type

We consider (,,,)structures of parabolic type on hypersurfaces of dual spaces and study the rank of the affinor . We consider almost contact metric structures of parabolic type of the first kind on hypersurfaces of 4dimensional dual metric space. We study the properties of these structures and give examples of normal, integrable, and Sasakian parabolic structures.     

On Some Generalizations and Refinements of a Ky Fan Inequality

In this paper, a Ky Fan inequality and an inequality by Wu and Wang [10] will be generalized. Some new and improved refinements of the Ky Fan inequality will be put forward.AMS Subject Classification (2000) 26D15     

On a Characterization of Integrability for the Reciprocal Weight of Orthogonal Polynomials on the Circle

We prove a necessary and sufficient condition for integrability of the reciprocal weight function of orthogonal polynomials. The condition is given in terms of the asymptotic behaviour of the norm of extremal polynomials with prescribed coefficients.     

On the Completeness and Decidability of the Horn‐Like Fragment of the First‐Order Linear Temporal Logic

We prove the completeness and decidability of the Hornlike sequents, specifically, the socalled D₂sequents (of the firstorder linear temporal logic) considered in the author's paper [Lith. Math. J., 41(3), 266–281 (2001)]. In this paper, with the help of the infinitary calculus G_L, grounded by the author in his earlier papers, for D₂sequents we construct a D₂Sat calculus of the socalled saturated type consisting of decidable deductive procedures replacing the omegarule for the always operator. In the present paper, in order to prove the completeness and decidability of the calculus D₂Sat, we construct the socalled invariant decidable calculus D₂IN. We prove the equivalence of the calculi D₂IN, D₂Sat, and G _L ^** for the socalled saturated D₂sequents. From this equivalence, by reducing an arbitrary D₂sequent to a saturated D₂sequent, and also from the completeness of the G _L ^** calculus and decidability of the invariant calculus D₂IN, we deduce the completeness and decidability of the calculus D₂Sat in the class of D₂sequents.     

Hulls for Various Kinds of α-Completeness in Archimedean Lattice-Ordered Groups

Within Archimedean -groups, and with an infinite cardinal or , we consider X-hulls where X stands for any of the following classes of -groups: -projectable; laterally -complete; boundedly laterally -complete; conditionally -complete; combinations of the preceding, together with divisibility and/or relative uniform completeness. All these hulls exist, and may be obtained by iterated adjunction of the required extra elements, within the essential hull. When the -groups is relatively -complemented one step in the iteration suffices for several crucial properties. We derive from the above a considerable number of equations involving combinations of these hull operators.     

On Generalizations of Ostrowski Inequality and Some Related Results

Some generalizations of the Ostrowski inequality, the Milovanovi-Peari-Fink inequality, the Dragomir-Agarwal inequality and the Hadamard inequality are given.     

<Emphasis Type="Italic">q</Emphasis>-Hypergeometric Proofs of Polynomial Analogues of the Triple Product Identity,Lebesgue’s Identity and Euler’s Pentagonal Number Theorem

We present alternative, q-hypergeometric proofs of some polynomial analogues of classical q-series identities recently discovered by Alladi and Berkovich, and Berkovich and Garvan.Work supported by the Australian Research Council     

Convergence of a generalized subgradient method for nondifferentiable convex optimization

A generalized subgradient method is considered which uses the subgradients at previous iterations as well as the subgradient at current point. This method is a direct generalization of the usual subgradient method. We provide two sets of convergence conditions of the generalized subgradient method. Our results provide a larger class of sequences which converge to a minimum point and more freedom of adjustment to accelerate the speed of convergence.Most of this research was performed when the first author was visiting Decision and Information Systems Department, College of Business, Arizona State University.     

Global Solutions of Multidimensional Approximate Navier–Stokes Equations of a Viscous Gas

Considering the simplified Navier–Stokes equations for the motion of a viscous gas under the adherence condition, we define a weak solution and prove an existence theorem by means of a priori estimates.     

The quadratic convergence of the topological epsilon algorithm for systems of nonlinear equations

In this work we consider the topological epsilon algorithm for solving systems of nonlinear equations. In section 2, a sufficient condition for its quadratic convergence is given. In section 3, some geometrical remarks about this condition are made.     

Fixed-Point Technique for Implicit Complementarity Problem in Hilbert Lattice

In this paper, we consider and study the implicit complementarity problem in the setting of a Hilbert lattice. It has been shown that this problem can be formulated as a fixed-point problem by using a suitable change of variables. Moreover, this formulation allows us to prove the existence and uniqueness of solutions of the implicit complementarity problem.     

From Pappus’ Theorem to the Twisted Cubic

We discuss a classical result in planar projective geometry known as Steiners theorem involving 12 interlocking applications of Pappus theorem. We prove this result using three dimensional projective geometry then uncover the dynamics of this construction and relate them to the geometry of the twisted cubic.Mathematics Subject Classification (2000). Primary 51N15.     

Some Properties of Isologism of Groups and Baer-Invariants

Let be a variety of groups defined by the set of laws V. In this paper we study the concept of -isologism of groups in terms of -extensions and their connections with the Baer-invariant of groups are also discussed.AMS Subject Classification (2000): primary 20F14, 20F19, secondary 20E10