Lagrangian Duality and Cone Convexlike Functions

In this paper, we consider first the most important classes of cone convexlike vector-valued functions and give a dual characterization for some of these classes. It turns out that these characterizations are strongly related to the closely convexlike and Ky Fan convex bifunctions occurring within minimax problems. Applying the Lagrangian perturbation approach, we show that some of these classes of cone convexlike vector-valued functions show up naturally in verifying strong Lagrangian duality for finite-dimensional optimization problems. This is achieved by extending classical convexity results for biconjugate functions to the class of so-called almost convex functions. In particular, for a general class of finite-dimensional optimization problems, strong Lagrangian duality holds if some vector-valued function related to this optimization problem is closely K-convexlike and satisfies some additional regularity assumptions. For K a full-dimensional convex cone, it turns out that the conditions for strong Lagrangian duality simplify. Finally, we compare the results obtained by the Lagrangian perturbation approach worked out in this paper with the results achieved by the so-called image space approach initiated by Giannessi.     

General models in min-max planar location: Checking optimality conditions

This paper studies the problem of deciding whether the present iteration point of some algorithm applied to a planar singlefacility min-max location problem, with distances measured by either anl _p -norm or a polyhedral gauge, is optimal or not. It turns out that this problem is equivalent to the decision problem of whether 0 belongs to the convex hull of either a finite number of points in the plane or a finite number of differentl _q -circles . Although both membership problems are theoretically solvable in polynomial time, the last problem is more difficult to solve in practice than the first one. Moreover, the second problem is solvable only in the weak sense, i.e., up to a predetermined accuracy. Unfortunately, these polynomial-time algorithms are not practical. Although this is a negative result, it is possible to construct an efficient and extremely simple linear-time algorithm to solve the first problem. Moreover, this paper describes an implementable procedure to reduce the second decision problem to the first with any desired precision. Finally, in the last section, some computational results for these algorithms are reported.The work of the second author was supported by JNICT (Portugal), under Contract BD/631/90-RM, during his stay at Erasmus University in Rotterdam.The authors would like to express their acknowledgments to Jan Brinkhuis for his suggestions and support and to Joe Mitchell for suggesting the simplifications leading to Algorithm 3.1. Also, the anonymous referees are acknowledged for their careful reading of the paper and their useful comments.     

Algebraic methods for the solution of linear functional equations

The equation

$$\sum^{n}_ {i=0} a_{i}f(b_{i}x + (1 - b_{i})y) = 0$$

belongs to the class of linear functional equations. The solutions form a linear space with respect to the usual pointwise operations. According to the classical results of the theory they must be generalized polynomials. New investigations have been started a few years ago. They clarified that the existence of non-trivial solutions depends on the algebraic properties of some related families of parameters. The problem is to find the necessary and sufficient conditions for the existence of non-trivial solutions in terms of these kinds of properties. One of the earliest results is due to Z. Daróczy [1]. It can be considered as the solution of the problem in case of n = 2. We are going to take more steps forward by solving the problem in case of n = 3.

     

Study of theS-matrix near bound states in the continuum

The behaviour ofS-matrix for potentials generating bound states in continuum in the neighbourhood of the positive bound state energies is studied. It is shown that unlike the case of usual negative energy bound states, theS-matrix does not have a pole at the positive bound state energy but becomes unity at the energy corresponding to bound states in continuum. Calculations ofS-waveS-matrix for a local potential constructed by Stillinger and Herrick and a separable nonlocal potential constructed by the present authors verify these results. Our results indicate that the bound states embedded in continuum constructedvia the von Neumann and Wigner procedure cannot be interpreted as resonances with zero width.     

New upper limit on the total neutrino mass from the 2 degree field galaxy redshift survey

We constrain f(nu) identical with Omega(nu)/Omega(m), the fractional contribution of neutrinos to the total mass density in the Universe, by comparing the power spectrum of fluctuations derived from the 2 Degree Field Galaxy Redshift Survey with power spectra for models with four components: baryons, cold dark matter, massive neutrinos, and a cosmological constant. Adding constraints from independent cosmological probes we find f(nu)<0.13 (at 95% confidence) for a prior of 0.1相似文献   

A unified treatment of single component replacement models

In this paper we discuss a general framework for single component replacement models. This framework is based on the regenerative structure of these models and by using results from renewal theory a unified presentation of the discounted and average finite and infinite horizon cost models is given. Finally, some well-known replacement models are discussed, and making use of the previous results an easy derivation of their cost functions is presented.     

The enthalpy of formation of 2II CH

The standard enthalpy of formation, δ_fH^o, of² II CH has been determined at converged levels of ab initio electronic structure theory, including high order coupled cluster and full configuration interaction benchmarks. The atomic Gaussian basis sets employed include the (aug)-cc-p(C)VXZ family with X = 3, 4, 5 and 6. Extrapolations to the complete one-particle basis set and the full configuration interaction limits, where appropriate, have been performed to reduce remaining computational errors. Additional improvements in the enthalpy of formation of ²II CH were achieved by appending the valence-only treatment with core-valence correlation, relativistic effects including spin-orbit correlation, and the diagonal Born-Oppenheimer correction. The recommended values for δfH^o ₀ and δA_f H _o ²⁹⁸ of ²II CH are 592.48^+0.47 _?0.56 kJ mol_?1 and 595.93 ^+0.47 _?0.56 kJ mol_?1, respectively.     

A deep cut ellipsoid algorithm for convex programming: Theory and applications

This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules that prevent some of the numerical instabilities and theoretical drawbacks usually associated with the algorithm are also provided. Moreover, for a large class of convex programs a simple proof of its rate of convergence is given and the relation with previously known results is discussed. Finally some computational results of the deep and central cut version of the algorithm applied to a min—max stochastic queue location problem are reported.Author on leave from D.E.I.O. (Universidade de Lisboa, Portugal). This research was supported by J.N.I.C.T. (Portugal) under contract number BD/631/90-RM.