ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (10,825)
  • Springer  (5,847)
  • Elsevier  (4,978)
  • American Meteorological Society
  • 1995-1999  (6,028)
  • 1990-1994  (4,437)
  • 1965-1969
  • 1955-1959  (91)
  • 1950-1954  (269)
  • 1995  (6,028)
  • 1990  (4,437)
  • 1956  (91)
  • 1953  (113)
  • 1950  (156)
  • Computer Science  (7,270)
  • Architecture, Civil Engineering, Surveying  (3,555)
Collection
  • Articles  (10,825)
Years
  • 1995-1999  (6,028)
  • 1990-1994  (4,437)
  • 1965-1969
  • 1955-1959  (91)
  • 1950-1954  (269)
Year
Journal
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 3-4 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 1-2 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 11-12 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 7-8 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 5-6 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 9-10 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 81-81 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 86-87 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 90-90 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 91-93 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 94-95 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 88-89 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 108-112 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 99-107 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 96-98 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 129-138 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 121-128 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Notes: In the previous article we covered what asset location systems (ALS) are and the features and benefits they offer. In this article we explore the various features to be considered when acquiring an ALS and steps to be taken. We discuss what users are saying they want in an ALS, including the results of a survey of vehicle tracking system users and providers.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 139-142 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 113-120 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Notes: Abstract The vertical component obtained from the Global Positioning System (GPS) observations is from the ellipsoid (a mathematical surface), and therefore needs to be converted to the orthometric height, which is from the geoid (represented by the mean sea level). The common practice is to use existing bench marks (around the four corners of a project area and interpolate for the rest of the area), but in many areas bench marks may not be available, in which case an existing geoid undulation is used. Present available global geoid undulation values are not generally as detailed as needed, and in many areas they are not known better than ±1 to ±5 m, because of many limitations. This article explains the difficulties encountered in obtaining precise geoid undulation with some example computations, and proposes a technique of applying corrections to the best available global geoid undulations using detailed free-air gravity anomalies (within a 2° × 2° area) to get relative centimeter accuracy. Several test computations have been performed to decide the optimal block sizes and the effective spherical distances to compute the regional and the local effects of gravity anomalies on geoid undulations by using the Stokes integral. In one test computation a 2° × 2° area was subdivided into smaller surface elements. A difference of 37.34 ± 1.6 cm in geoid undulation was obtained over the same 2° × 2° area when 1° × 1° block sizes were replaced by a combination of 5' × 5' and 1' × 1' subdivision integration elements (block sizes).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 143-144 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 145-146 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 148-149 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 146-146 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 23-27 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Notes: This is the first in a series of three articles authored by John Beukers. In this series, John will lead us through some of today's relevant radionavigation history putting turbulent times into perspective. Picking out what he considers significant in the current debate, he projects the future for satellite and terrestrial radionavigation systems well into the 21st century.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 48-53 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 38-47 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 54-58 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 59-64 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 13-22 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Notes: Asset location systems, including vehicle and property tracking systems, are in the verge of exploding onto the scene for widespread business and personal use. This is due in part to decreased costs of GPS equipment, and greater availability of wireless communication systems, but also largely due to public awareness of their capabilities and benefits. Companies, organizations, and individual consumers that earlier could not justify the costs of tracking systems are now seriously considering their implementation. Public awareness of such systems is growing daily. Newspapers regularly have articles covering the latest applications of GPS. En route nagivation for aircraft, assisting blind people to navigate the streets of a city, and tracking skiers on slopes are some of the topics of recent newspapers articles on GPS. This article explores GPS asset location systems, looks at their features and foibles, and considers their cost, utility, ease of use, and drawbacks.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 28-37 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Notes: Executive Summary GPS is a scientific method used as an adjunct to geographic information systems (GIS) for determining high-accuracy control points over large areas. Recent improvements in receiver technology, differential surveying, and software have made use of GPS technology more practical for smaller GIS projects. This article compares three different GPSs with occupation times of 2 and 12 min using an existing control network, comparing the location of the points and the distances between points. The control network internal distances vary from 40 to 280 m, and within 2000 m of the nearest second-order National Geodetic Survey (NGS) triangulation station. The partnership of GPS and GIS will lead to higher surveying integrity while improving digital mapping on the ground over small and large areas. It also allows for postsurvey analysis with solutions coming from multiple base stations. Presented here is a case study of how to achieve highly accurate and effective control points using using GPS/GIS, particularly for a small area.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 65-73 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Notes: The NAVSTAR Global Positioning System is a space-based, all-weather, worldwide satellite navigation system. GPS uses the constellation of satellites and associated ground equipment to perform the primary missions of highly accurate navigation, time transfer, and nuclear detonation detection. To achieve these missions, GPS has three clearly defined segments – space, user and control (see Figure 1). The control segment, otherwise referred to as the operational control segment (OCS), consists of the personnel and equipment that controls the space segment and interfaces with the user segment. The OCS is made up of the master control station (MCS), the ground antennas (GA), and the monitor stations (MS). The purpose of this article is to describe how the 2nd Space Operations Squadron runs the MCS, the key element of the OCS.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 74-75 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 76-79 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 80-80 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    GPS solutions 1 (1995), S. 85-85 
    ISSN: 1521-1886
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 4 (1990), S. 27-41 
    ISSN: 1436-3259
    Keywords: Groundwater monitoring networks ; Information reliability ; Information scales ; Kalman filtering in groundwater
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract The extensive use of groundwater resources has increased the need for developing cost-effective monitoring networks to provide an indication of the degree to which the subsurface environment has been affected by human activities. This study presents a cost-effective approach to the design of groundwater flow monitoring networks. The groundwater network design is formulated with two problem formats: maximizing the statistical monitoring power for specified budget constraint and minimizing monitoring cost for statistical power requirement. The statistical monitoring power constraint is introduced with an information reliability threshold value. A branch and bound technique is employed to select the optimal solution from a discrete set of possible network alternatives. The method is tested to the design of groundwater flow monitoring problem in the Pomona County, California.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 4 (1990), S. 65-81 
    ISSN: 1436-3259
    Keywords: Lagoons ; Ponds ; Facultative ; First-order kinetics ; Complete mixing ; Probabilistic ; Uncertainty ; Environmental ; Stochastic differential equations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract Two stochastic models are developed to describe the BOD output (i.e. effluent) variation of facultative aerated lagoons in series. One of the models uses the uncertainty analysis (UA) technique and the other is based on the moment equation solution methodology of stochastic differential equations (SDE's). The former considers a second-order approximation of the expectation (SOAE) and a first-order approximation of the variance (FOAV). The SDE model considers that output variability is accounted for by random variations in the rate coefficient. Comparisons are provided. Calibration and verification of the two models are aciieved by using field observations from two different lagoon systems in series. The predictive performances of the two models are compared with each other and with another SDE model, presented in a previous paper, that considers input randomness. The three methods show similar predictive performances and provide good predictions of the mean and standard deviation of the lagoon effluent BOD concentrations and thus are considered as appropriate methodologies.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 4 (1990), S. 89-103 
    ISSN: 1436-3259
    Keywords: maximum precipitation depths ; extreme-value distributions ; seasonal variation ; partial duration series ; model misspecification
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract Quantile estimates of the annual maximum distribution can be obtained by fitting theoretical distributions to the maxima in separate seasons, e.g. to the monthly maxima. In this paper, asymptotic expressions for the bias and the variance of such estimates are derived for the case that the seasonal maxima follow a Gumbel distribution. Results from these expressions are presented for a situation with no seasonal variation and for maximum precipitation depths at Uccle/Ukkel (Belgium). It is shown that the bias is often negligible and that the variance reduction by using seasonal maxima instead of just the annual maxima strongly depends on the seasonal variation in the data. A comparison is made between the asymptotic standard error of quantile estimates from monthlymaxima with those from a partial duration series. Much attention is paid to the effect of model misspecification on the resulting quantile estimates of the annual maximum distribution. The use of seasonal maxima should be viewed with caution when the upper tail of this distribution is of interest.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 4 (1990), S. 193-208 
    ISSN: 1436-3259
    Keywords: Stochastic tidal modeling ; parameter identification ; model calibration
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract In this paper a parameter estimation algorithm is developed to estimate uncertain parameters in two dimensional shallow water flow models. Since in practice the open boundary conditions of these models are usually not known accurately, the uncertainty of these boundary conditions has to be taken into account to prevent that boundary errors are interpreted by the estimation procedure as parameter fluctuations. Therefore the open boundary conditions are embedded into a stochastic environment and a constant gain extended Kalman filter is employed to identify the state of the system. Defining a error functional that measures the differences between the filtered state of the system and the measurements, a quasi Newton method is employed to determine the minimum of this functional. To reduce the computational burden, the gradient of the criterium that is required using the quasi Newton method is determined by solving the adjoint system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 4 (1990), S. 217-226 
    ISSN: 1436-3259
    Keywords: Exponential distribution ; bivariate exponential distribution ; distribution of flood volume ; partial duration series
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract A methodology based on the theory of stochastic processes is applied to the analysis of floods. The approach will be based on some results of the theory of extreme values over a threshold. In this paper, we focus on the estimation of the distribution of the flood volume in partial duration series analysis of flood phenomena, by using a bivariate exponential distribution of discharge exceedances and durations over a base level.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 4 (1990), S. 254-254 
    ISSN: 1436-3259
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 4 (1990), S. 277-294 
    ISSN: 1436-3259
    Keywords: Water distribution ; optimization ; nonlinear programming ; integer programming ; chance constraints ; rehabilation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract This paper presents the mathematical development of an integer — nonlinear programming chance — constrained optimization model for the minimum cost rehabilitation/replacement of water distribution system components. Particular attention is given to the handling of uncertainties in the roughness factors and the loading conditions including both the random demand and preassure head requirements. The advantages of the proposed model include the ability to: 1) handle the optimal timing of rehabilitation/replacement for water distribution system components; 2) link a mixed-integer linear program solver, a nonlinear program solver, and a hydraulic simulator into an optimization framework; 3) handle the uncertainties of some of the variables; 4) incorporate various kinds of cost functions; and 5) handle multiple loading conditions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 4 (1990), S. 309-320 
    ISSN: 1436-3259
    Keywords: Entropy ; reliability ; redundancy ; water distribution networks ; nodal pair reliability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract Entropy based expressions for measurement of reliability and redundancy have recently been reported. These measures approach assessment of the reliability of the distribution network from the intrinsic redundancy of the network layout. The paper extends earlier work on entropy functions by including a more explicit statement of the alternate paths available in the network and by recognizing that under certain circumstances, e.g., failure of some part of the network work, an outflow link from a node under normal working condition may become an inflow link to the same node. The measures are assessed by comparison with parameters measuring Nodal Pair Reliability and percentage of flow supplied at adequate pressure for a range of networks and link failure conditions in this networks. The entropy measures are shown to reflect changes in the network reliability, as measured by these two comparative parameters, very well.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 9 (1995), S. 33-47 
    ISSN: 1436-3259
    Keywords: Hidden markov models ; maximum likelihood estimation ; EM algorithm ; martingale estimating function ; forward-backward algorithm ; Monte Carlo ; filtering ; Nash cascade model ; rainfall runoff modeling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract Many stochastic process models for environmental data sets assume a process of relatively simple structure which is in some sense partially observed. That is, there is an underlying process (Xn, n ≥ 0) or (Xt, t ≥ 0) for which the parameters are of interest and physically meaningful, and an observable process (Yn, n ≥ 0) or (Yt, t ≥ 0) which depends on the X process but not otherwise on those parameters. Examples are wide ranging: the Y process may be the X process with missing observations; the Y process may be the X process observed with a noise component; the X process might constitute a random environment for the Y process, as with hidden Markov models; the Y process might be a lower dimensional function or reduction of the X process. In principle, maximum likelihood estimation for the X process parameters can be carried out by some form of the EM algorithm applied to the Y process data. In the paper we review some current methods for exact and approximate maximum likelihood estimation. We illustrate some of the issues by considering how to estimate the parameters of a stochastic Nash cascade model for runoff. In the case of k reservoirs, the outputs of these reservoirs form a k dimensional vector Markov process, of which only the kth coordinate process is observed, usually at a discrete sample of time points.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 9 (1995), S. 117-132 
    ISSN: 1436-3259
    Keywords: River Quality ; network ; computer model ; Thermodynamics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract In this paper, concepts of network thermodynamics are applied to a river water quality model, which is based on Streeter-Phelps equations, to identify the corresponding physical components and their topology. Then, the randomness in the parameters, input coefficients and initial conditions are modeled by Gaussian white noises. From the stochastic components of the physical system description of problem and concepts of physical system theory, a set of stochastic differential equations can be automatically generated in a computer and the recent developments on the automatic formulation of the moment equations based on Ito calculus can be used. This procedure is illustrated through the solution of an example of stochastic river water quality problem and it is also shown how other related problems with different configurations can be automatically solved in a computer using just one software.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 9 (1995), S. 171-205 
    ISSN: 1436-3259
    Keywords: AR-AIC-Bayes filter ; autoregressive spectral density estimation ; diagnostic checks for ARMA models ; exploratory data analysis ; fast Fourier transform ; Hurst coefficient ; long-memory times series ; periodogram smoothing ; riverflow time series ; spectral density plots
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract Current methods of estimation of the univariate spectral density are reviewed and some improvements are made. It is suggested that spectral analysis may perhaps be best thought of as another exploratory data analysis (EDA) tool which complements, rather than competes with, the popular ARMA model building approach. A new diagnostic check for ARMA model adequacy based on the nonparametric spectral density is introduced. Additionally, two new algorithms for fast computation of the autoregressive spectral density function are presented. For improving interpretation of results, a new style of plotting the spectral density function is suggested. Exploratory spectral analyses of a number of hydrological time series are performed and some interesting periodicities are suggested for further investigation. The application of spectral analysis to determine the possible existence of long memory in natural time series is discussed with respect to long riverflow, treering and mud varve series. Moreover, a comparison of the estimated spectral densities suggests the ARMA models fitted previously to these datasets adequately describe the low frequency component. Finally, the software and data used in this paper are available by anonymous ftp from fisher.stats.uwo.ca.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 9 (1995), S. 215-237 
    ISSN: 1436-3259
    Keywords: Computation ; discretization ; entropy ; networks ; time averaging ; water quality
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract The computational aspects of using a new, entropy-based, theory to predict water quality values at discontinued water quality monitoring stations are discussed. The main computational issues addressed are the level of discretization used in converting the continuous probability distribution of water quality values to the discrete levels required for the entropy function, and the choice of the interval of time for which to assign the value of the water quality (period of time averaging) through the entropy function. Unlike most cases of entropy applications involving discretization of continuous functions the results of using entropy theory to predict water quality values at discontinued monitoring stations in this application appear to be insensitive to the choice of the level of discretization even down to the very coarse level discretization associated with only eight intervals. However, depending on the length of record available the choice of the time interval for which the water quality values are assigned (period for time averaging) appear to have a significant impact on the accuracy of the results.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 4 (1990), S. 1-26 
    ISSN: 1436-3259
    Keywords: Inverse ; calibration ; estimation ; groundwater flow
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract The development of stochastic methods for groundwater flow representation has undergone enormous expansion in recent years. The calibration of groundwater models, the inverse problem, has lately received comparable attention especially and almost exclusively from the stochastic perspective. In this review we trace the evolution of the methods to date with a specific view toward identifying the most important issues involved in the usefulness of the approaches. The methods are critiqued regarding practical usefulness, and future directions for requisite study are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 4 (1990), S. 55-64 
    ISSN: 1436-3259
    Keywords: Predictive distribution ; Bayesian approximation ; parameter uncertainty ; non-informative prior ; method of moments ; Gumbel distribution ; maximum likelihood estimates
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract In this paper Lindley's Bayesian approximation procedure is used to obtain the Bayes estimate of the probability of exceedence of a flood discharge. The Bayes estimates of the probability of exceedence has been shown by S.K. Sinha to be equivalent to the estimate of the probability of exceedence from the predictive or Bayesian disribution, of a future flood discharge. The evaluation of complex ratios of multiple integrals common in a Bayesian analysis is not necessary using Lindley's procedure. The Bayes estimates are compared to those obtained by the method of maximum likelihood and the method of moments. The results show that Bayes estimates of the probability of exceedence are larger as expected, but have smaller posterior standard deviations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 4 (1990), S. 105-119 
    ISSN: 1436-3259
    Keywords: Kalman filtering ; Optimal smoothing ; Shallow water equations ; Wind stress ; On-line prediction
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract Using the state space approach, an on-line filter procedure for combined wind stress identification and tidal flow forecasting is developed. The stochastic dynamic approach is based on the linear twodimensional shallow water equations. Using a finite difference scheme, a system representation of the model is obtained. To account for uncertainties, the system is embedded into a stochastic environment. By employing a Kalman filter, the on-line measurements of the water-level available can be used to identify and predict the shallow water flow. Because it takes a certain time before a fluctuation in the wind stress can be noticed in the water-level measurements, an optimal fixed-lag smoother is used to identify the stress.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 4 (1990), S. 135-150 
    ISSN: 1436-3259
    Keywords: Radar ; rainfall prediction ; real-time prediction
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract A computational method for the determination of rainfall distribution for applications in short term rainfall prediction is presented here. The method is strongly influenced by the experience gained from the observation and analysis of data gathered on a heavy rainfall event in 1986 that occurred during the Baiu Season in Japan. The method is based on the concept that rainfall occurs as an interaction between an instability field, appropriately modeled, and a field of water vapor under the influence of topography. The results from this computational method showed good agreement with the temporal variation in the rainband that moved across the observation field in 1986. Towards determination of the parameters in the computational model, another method for the determination of the rainfield is also developed. This second method determines the rainfall distribution from estimation of the conversion rate of water vapor to liquid water through use of data from a three dimensional scanning radar. The results are consistent with those obtained from the first method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 4 (1990), S. 151-160 
    ISSN: 1436-3259
    Keywords: Instantaneous Unit Hydrograph ; Conceptual models ; Stochastic differential equations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract Recognizing that simple watershed conceptual models such as the Nash cascade ofn equal linear reservoirs continue to be reasonable means to approximate the Instantaneous Unit Hydrograph (IUH), it is natural to accept that random errors generated by climatological variability of data used in fitting an imprecise conceptual model will produce an IUH which is random itself. It is desirable to define the random properties of the IUH in a watershed in order to have a more realistic hydrologic application of this important function. Since in this case the IUH results from a series of differential equations where one or more of the uncertain parameters is treated in stochastic terms, then the statistical properties of the IUH are best described by the solution of the corresponding Stochastic Differential Equations (SDE's). This article attempts to present a methodology to derive the IUH in a small watershed by combining a classical conceptual model with the theory of SDE's. The procedure is illustrated with the application to the Middle Thames River, Ontario, Canada, and the model is verified by the comparison of the simulated statistical measures of the IUH with the corresponding observed ones with good agreement.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 9 (1995), S. 13-32 
    ISSN: 1436-3259
    Keywords: Distributed parameter filter ; shallow water equations ; distributed dynamical systems ; data assimilation ; white Gaussian noise
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract Distributed parameter filtering theory is employed for estimating the state variables and associated error covariances of a dynamical distributed system under highly random tidal and meteorological influences. The stochastic-deterministic mathematical model of the physical system under study consists of the shallow water equations described by the momentum and continuity equations in which the external forces such as Coriolis force, wind friction, and atmospheric pressure are considered. White Gaussian noises in the system and measurement equations are used to account for the inherent stochasticity of the system. By using an optimal distributed parameter filter, the information provided by the stochastic dynamical model and the noisy measurements taken from the actual system are combined to obtain an optimal estimate of the state of the system, which in turn is used as the initial condition for the prediction procedure. The approach followed here has numerical approximation carried out at the end, which means that the numerical discretization is performed in the filtering equations, and not in the equations modelling the system. Therefore, the continuous distributed nature of the original system is maintained as long as possible and the propagation of modelling errors in the problem is minimized. The appropriateness of the distributed parameter filter is demonstrated in an application involving the prediction of storm surges in the North Sea. The results confirm excellent filter performance with considerable improvement with respect to the deterministic prediction.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    Electronic Resource
    Electronic Resource
    Springer
    Stochastic environmental research and risk assessment 9 (1995), S. 77-88 
    ISSN: 1436-3259
    Keywords: Extreme rainfalls ; partial duration series ; regional estimation ; Bayes' theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Energy, Environment Protection, Nuclear Power Engineering , Geography , Geosciences
    Notes: Abstract Based on the Partial Duration Series model a regional Bayesian approach is introduced in the modelling of extreme rainfalls from a country-wide system of recording raingauges in Denmark. The application of the Bayesian principles is derived in case of both exponential and generalized Pareto-distributed exceedances. The method is applied to, respectively, the total precipitation depth and the maximum 10 minutes rain intensity of individual storms from 41 stations. By means of the regional analysis prior distributions of the parameters in the Partial Duration Series model are estimated. It is shown that the regional approach significantly reduces the uncertainty of the T-year event estimator compared to estimation based solely on at-site data. In addition, the regional approach provides quantile estimates at non-monitored sites.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 49 (1990), S. 163-187 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A commonly studied relaxation of the travelling salesman problem is obtained by adding subtour elimination constraints to the constraints of a 2-factor problem and removing the integrality requirement. We investigate the problem of solving this relaxation for a special type of objective function. We also discuss some ways in which this relates to the concept of rank introduced by Chvátal.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 46 (1990), S. 1-29 
    ISSN: 1436-4646
    Keywords: Global optimization ; concurrent ; parallel ; stochastic ; network of computers
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The global optimization problem, finding the lowest minimizer of a nonlinear function of several variables that has multiple local minimizers, appears well suited to concurrent computation. This paper presents a new parallel algorithm for the global optimization problem. The algorithm is a stochastic method related to the multi-level single-linkage methods of Rinnooy Kan and Timmer for sequential computers. Concurrency is achieved by partitioning the work of each of the three main parts of the algorithm, sampling, local minimization start point selection, and multiple local minimizations, among the processors. This parallelism is of a coarse grain type and is especially well suited to a local memory multiprocessing environment. The paper presents test results of a distributed implementation of this algorithm on a local area network of computer workstations. It also summarizes the theoretical properties of the algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 46 (1990), S. 105-122 
    ISSN: 1436-4646
    Keywords: Nondifferentiable minimization ; convex programming ; numerical methods ; descent methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Proximal bundle methods for minimizing a convex functionf generate a sequence {x k } by takingx k+1 to be the minimizer of $$\hat f^k (x) + u^k |x - x^k |^2 /2$$ , where $$\hat f^k $$ is a sufficiently accurate polyhedral approximation tof andu k 〉 0. The usual choice ofu k = 1 may yield very slow convergence. A technique is given for choosing {u k } adaptively that eliminates sensitivity to objective scaling. Some encouraging numerical experience is reported.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 58
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 46 (1990), S. 127-151 
    ISSN: 1436-4646
    Keywords: Dual descent ; monotropic program ; Tucker tableau ; elementary vector
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We propose a dual descent method for the problem of minimizing a convex, possibly nondifferentiable, separable cost subject to linear constraints. The method has properties reminiscent of the Gauss-Seidel method in numerical analysis and uses theε-complementary slackness mechanism introduced in Bertsekas, Hosein and Tseng (1987) to ensure finite convergence to near optimality. As special cases we obtain the methods in Bertsekas, Hosein and Tseng (1987) for network flow programs and the methods in Tseng and Bertsekas (1987) for linear programs.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 46 (1990), S. 219-224 
    ISSN: 1436-4646
    Keywords: Algebraic optimization ; location theory ; ellipsoid algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The Fermat-Weber location problem is to find a point in ℝ n that minimizes the sum of the (weighted) Euclidean distances fromm given points in ℝ n . In this work we discuss some relevant complexity and algorithmic issues. First, using Tarski's theory on solvability over real closed fields we argue that there is an infinite scheme to solve the problem, where the rate of convergence is equal to the rate of the best method to locate a real algebraic root of a one-dimensional polynomial. Secondly, we exhibit an explicit solution to the strong separation problem associated with the Fermat-Weber model. This separation result shows that anε-approximation solution can be constructed in polynomial time using the standard Ellipsoid Method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 46 (1990), S. 255-256 
    ISSN: 1436-4646
    Keywords: Linear complementarity problem ; P-matrix
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We give a short proof of the finiteness of Murty's principal pivoting algorithm for solving the linear complementarity problemy = Mz + q, y T z = 0,y ≥ 0,z ≥ 0 withP-matrixM.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 61
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 47 (1990), S. 305-336 
    ISSN: 1436-4646
    Keywords: Trust region ; linear constraints ; convex constraints ; global convergence ; local convergence ; degeneracy ; rate of convergence ; identification of active constraints ; Newton's method ; sequential quadratic programming ; gradient projection
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We develop a convergence theory for convex and linearly constrained trust region methods which only requires that the step between iterates produce a sufficient reduction in the trust region subproblem. Global convergence is established for general convex constraints while the local analysis is for linearly constrained problems. The main local result establishes that if the sequence converges to a nondegenerate stationary point then the active constraints at the solution are identified in a finite number of iterations. As a consequence of the identification properties, we develop rate of convergence results by assuming that the step is a truncated Newton method. Our development is mainly geometrical; this approach allows the development of a convergence theory without any linear independence assumptions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 47 (1990), S. 425-439 
    ISSN: 1436-4646
    Keywords: Isotonic regression ; active sets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this and subsequent papers we will show that several algorithms for the isotonic regression problem may be viewed as active set methods. The active set approach provides a unifying framework for studying algorithms for isotonic regression, simplifies the exposition of existing algorithms and leads to several new efficient algorithms. We also investigate the computational complexity of several algorithms. In this paper we consider the isotonic regression problem with respect to a complete order $$\begin{gathered} minimize\sum\limits_{i = 1}^n {w_i } (y_i - x_i )^2 \hfill \\ subject tox_1 \leqslant x_2 \leqslant \cdot \cdot \cdot \leqslant x_n \hfill \\ \end{gathered} $$ where eachw i is strictly positive and eachy i is an arbitrary real number. We show that the Pool Adjacent Violators algorithm (due to Ayer et al., 1955; Miles, 1959; Kruskal, 1964), is a dual feasible active set method and that the Minimum Lower Set algorithm (due to Brunk et al., 1957) is a primal feasible active set method of computational complexity O(n 2). We present a new O(n) primal feasible active set algorithm. Finally we discuss Van Eeden's method and show that it is of worst-case exponential time complexity.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 47 (1990), S. 463-463 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 48 (1990), S. 1-17 
    ISSN: 1436-4646
    Keywords: Coercivity ; quadratic programming ; linear programming ; aggregation ; relaxation ; multigrid methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper is concerned with multilevel iterative methods which combine a descent scheme with a hierarchy of auxiliary problems in lower dimensional subspaces. The construction of auxiliary problems as well as applications to elasto-plastic model and linear programming are described. The auxiliary problem for the dual of a perturbed linear program is interpreted as a dual of perturbed aggregated linear program. Coercivity of the objective function over the feasible set is sufficient for the boundedness of the iterates. Equivalents of this condition are presented in special cases.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 49 (1990), S. 91-111 
    ISSN: 1436-4646
    Keywords: Sparse matrices ; linear programming ; bipartite matching
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Many optimization algorithms involve repeated processing of a fixed set of linear constraints. If we pre-process the constraint matrixA to be sparser, then algebraic operations onA will become faster. We consider the problem of making a given matrix as sparse as possible, theSparsity Problem (SP). In a companion paper with S. Frank Chang, we developed some theoretical algorithms for SP under a non-degeneracy assumption (McCormick and Chang, 1988). Here we investigate what must be done to make those algorithms applicable in practice. We report encouraging computational results in making linear programming constraint matrices sparser. We also find that the Simplex Algorithm can solve the reduced LPs faster. Comparisons are made to a heuristic algorithm for SP of Adler et al. (1989).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    ISSN: 1436-4646
    Keywords: Quasi-Newton methods ; collinear scalings ; conic approximations ; local and q-superlinear convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper is concerned with collinear scaling algorithms for unconstrained minimization where the underlying local approximants are forced to interpolate the objective function value and gradient at only the two most recent iterates. By suitably modifying the procedure of Sorensen (1980) for deriving such algorithms, we show that two members of the algorithm class derived related to the DFP and BFGS methods respectively are locally and q-superlinearly convergent. This local analysis as well as the results they yield exhibit the same sort of “duality” exhibited by those of Broyden, Dennis and Moré (1973) and Dennis and Moré (1974) for the DFP and BFGS methods. The results in this paper also imply the local and q-superlinear convergence of collinear scaling algorithms of Sorensen (1982, pp. 154–156) related to the DFP and BFGS methods.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 49 (1990), S. 139-141 
    ISSN: 1436-4646
    Keywords: Linear complementarity problem ; copositive ; strictly copositive ; Q-matrix
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Recently, Jeter and Pye gave an example to show that Pang's conjecture, thatL 1 ⋂Q $$ \subseteq R_0 $$ , is false. We show in this article that the above conjecture is true for symmetric matrices. Specifically, we show that a symmetric copositive matrix is inQ if and only if it is strictly copositive.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 49 (1990), S. 145-162 
    ISSN: 1436-4646
    Keywords: Linear programming ; interior-point methods ; primal—dual algorithms ; feasibility
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A new method for obtaining an initial feasible interior-point solution to a linear program is presented. This method avoids the use of a “big-M”, and is shown to work well on a standard set of test problems. Conditions are developed for obtaining a near-optimal solution that is feasible for an associated problem, and details of the computational testing are presented. Other issues related to obtaining and maintaining accurate feasible solutions to linear programs with an interior-point method are discussed. These issues are important to consider when solving problems that have no primal or dual interior-point feasible solutions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 49 (1990), S. 231-251 
    ISSN: 1436-4646
    Keywords: Nonsmooth optimization ; subgradient ; ε-subgradient ; exact penalty function ; successive quadratic programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we present an algorithm for solving nonlinear programming problems where the objective function contains a possibly nonsmooth convex term. The algorithm successively solves direction finding subproblems which are quadratic programming problems constructed by exploiting the special feature of the objective function. An exact penalty function is used to determine a step-size, once a search direction thus obtained is judged to yield a sufficient reduction in the penalty function value. The penalty parameter is adjusted to a suitable value automatically. Under appropriate assumptions, the algorithm is shown to produce an approximate optimal solution to the problem with any desirable accuracy in a finite number of iterations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 49 (1990), S. 325-340 
    ISSN: 1436-4646
    Keywords: Convex quadratic programming ; interior point method ; Karmarkar's method ; logarithmic barrier function method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We present a primal interior point method for convex quadratic programming which is based upon a logarithmic barrier function approach. This approach generates a sequence of problems, each of which is approximately solved by taking a single Newton step. It is shown that the method requires $$O(\sqrt n L)$$ iterations and O(n 3.5 L) arithmetic operations. By using modified Newton steps the number of arithmetic operations required by the algorithm can be reduced to O(n 3 L).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 49 (1990), S. 371-379 
    ISSN: 1436-4646
    Keywords: Z-function ; strong solvability with nonnegativity ; strictly semimonotone function
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper focuses on the relationship between the ‘strong’ solvability of a certain system involving a Z-function, and the strict semimonotonicity of such a function. Our main result shows that, for a system defined by a continuous, superhomogeneous Z-function, the additional condition of strict semimonotonicity is both necessary and sufficient for strong solvability.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 49 (1990), S. 397-411 
    ISSN: 1436-4646
    Keywords: Concave functions ; knapsack problems ; strict minimizers ; NP-hard ; nonconvex ; local minimizers
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider a version of the knapsack problem which gives rise to a separable concave minimization problem subject to bounds on the variables and one equality constraint. We characterize strict local miniimizers of concave minimization problems subject to linear constraints, and use this characterization to show that although the problem of determining a global minimizer of the concave knapsack problem is NP-hard, it is possible to determine a local minimizer of this problem with at most O(n logn) operations and 1+[logn] evaluations of the function. If the function is quadratic this algorithm requires at most O(n logn) operations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 68 (1995), S. 105-130 
    ISSN: 1436-4646
    Keywords: primary 49B34 ; secondary 90C31 ; 93C30 ; Variational inequalities ; Sensitivity analysis ; Generalized Jacobian
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Optimization problems with variational inequality constraints are converted to constrained minimization of a local Lipschitz function. To this minimization a non-differentiable optimization method is used; the required subgradients of the objective are computed by means of a special adjoint equation. Besides tests with some academic examples, the approach is applied to the computation of the Stackelberg—Cournot—Nash equilibria and to the numerical solution of a class of quasi-variational inequalities.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 69 (1995), S. 1-43 
    ISSN: 1436-4646
    Keywords: Mathematical programming ; Cutting planes ; Analytic center
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Anoracle for a convex setS ⊂ ℝ n accepts as input any pointz in ℝ n , and ifz ∈S, then it returns ‘yes’, while ifz ∉S, then it returns ‘no’ along with a separating hyperplane. We give a new algorithm that finds a feasible point inS in cases where an oracle is available. Our algorithm uses the analytic center of a polytope as test point, and successively modifies the polytope with the separating hyperplanes returned by the oracle. The key to establishing convergence is that hyperplanes judged to be ‘unimportant’ are pruned from the polytope. If a ball of radius 2−L is contained inS, andS is contained in a cube of side 2 L+1, then we can show our algorithm converges after O(nL 2) iterations and performs a total of O(n 4 L 3+TnL 2) arithmetic operations, whereT is the number of arithmetic operations required for a call to the oracle. The bound is independent of the number of hyperplanes generated in the algorithm. An important application in which an oracle is available is minimizing a convex function overS.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 69 (1995), S. 45-73 
    ISSN: 1436-4646
    Keywords: Cutting plane ; Stochastic programming ; Analytic center ; Interior-point method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The stochastic linear programming problem with recourse has a dual block-angular structure. It can thus be handled by Benders' decomposition or by Kelley's method of cutting planes; equivalently the dual problem has a primal block-angular structure and can be handled by Dantzig-Wolfe decomposition—the two approaches are in fact identical by duality. Here we shall investigate the use of the method of cutting planes from analytic centers applied to similar formulations. The only significant difference form the aforementioned methods is that new cutting planes (or columns, by duality) will be generated not from the optimum of the linear programming relaxation, but from the analytic center of the set of localization.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 69 (1995), S. 237-253 
    ISSN: 1436-4646
    Keywords: Variational inequality ; Nonlinear complementarity ; Nonlinear programming ; Continuation method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper presents a continuation method for monotone variational inequality problems based on a new smooth equation formulation. The existence, uniqueness and limiting behavior of the path generated by the method are analyzed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 69 (1995), S. 269-309 
    ISSN: 1436-4646
    Keywords: Quadratic programming ; Submodular constraints ; Kuhn-Tucker conditions ; Lexicographically optimal flow ; Parametric maximum flow
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We present new strongly polynomial algorithms for special cases of convex separable quadratic minimization over submodular constraints. The main results are: an O(NM log(N 2/M)) algorithm for the problemNetwork defined on a network onM arcs andN nodes; an O(n logn) algorithm for thetree problem onn variables; an O(n logn) algorithm for theNested problem, and a linear time algorithm for theGeneralized Upper Bound problem. These algorithms are the best known so far for these problems. The status of the general problem and open questions are presented as well.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 69 (1995), S. 335-349 
    ISSN: 1436-4646
    Keywords: Polyhedral combinatorics ; Valid inequalities ; Travelling salesman ; Worst-case analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider most of the known classes of valid inequalities for the graphical travelling salesman polyhedron and compute the worst-case improvement resulting from their addition to the subtour polyhedron. For example, we show that the comb inequalities cannot improve the subtour bound by a factor greater than 10/9. The corresponding factor for the class of clique tree inequalities is 8/7, while it is 4/3 for the path configuration inequalities.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 79
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 70 (1995), S. 1-16 
    ISSN: 1436-4646
    Keywords: Stochastic programming ; Polyhedral functions ; Simplicial functions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A dual method is presented to solve a linearly constrained optimization problem with convex, polyhedral objective function, along with a fast bounding technique, for the optimum value. The method can be used to solve problems, obtained from LPs, where some of the constraints are not required to be exactly satisfied but are penalized by piecewise linear functions, which are added to the objective function of the original problem. The method generalizes an earlier solution technique developed by Prékopa (1990). Applications to stochastic programming are also presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 80
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 70 (1995), S. 107-122 
    ISSN: 1436-4646
    Keywords: Linear complementarity problem ; Predictor—corrector algorithm ; Complexity analysis ; Central trajectory ; Curvature integral ; Interior-point methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper, we propose a predictor—corrector-type algorithm for solving the linear complementarity problem (LCP), and prove that the actual number of iterations needed by the algorithm is bounded from above and from below by a curvature integral along the central trajectory of the problem. This curvature integral is not greater than, and possibly smaller than, the best upper bound obtained in the literature to date.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 81
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 70 (1995), S. 159-172 
    ISSN: 1436-4646
    Keywords: Parametric nonlinear programming ; Directional differentiability ; B-derivative ; Piecewise smooth function ; Nonunique multipliers ; Degeneracy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Consider a parametric nonlinear optimization problem subject to equality and inequality constraints. Conditions under which a locally optimal solution exists and depends in a continuous way on the parameter are well known. We show, under the additional assumption of constant rank of the active constraint gradients, that the optimal solution is actually piecewise smooth, hence B-differentiable. We show, for the first time to our knowledge, a practical application of quadratic programming to calculate the directional derivative in the case when the optimal multipliers are not unique.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 82
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 70 (1995), S. 191-200 
    ISSN: 1436-4646
    Keywords: Strictly pseudomonotone map ; Z-map ; Complementarity problem ; Least element problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Strictly pseudomonotoneZ-maps operating on Banach lattices are considered. Equivalence of complementarity problems and least-element problems is established under certain regularity and growth conditions. This extends a recent result by Riddell (1981) for strictly monotoneZ-maps to the pseudomonotone case. Some other problems equivalent to the above are discussed as well.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 83
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 70 (1995), S. 251-277 
    ISSN: 1436-4646
    Keywords: Linear programming ; Barrier methods ; Interior-point methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Many interior-point methods for linear programming are based on the properties of the logarithmic barrier function. After a preliminary discussion of the convergence of the (primal) projected Newton barrier method, three types of barrier method are analyzed. These methods may be categorized as primal, dual and primal—dual, and may be derived from the application of Newton's method to different variants of the same system of nonlinear equations. A fourth variant of the same equations leads to a new primal—dual method. In each of the methods discussed, convergence is demonstrated without the need for a nondegeneracy assumption or a transformation that makes the provision of a feasible point trivial. In particular, convergence is established for a primal—dual algorithm that allows a different step in the primal and dual variables and does not require primal and dual feasibility. Finally, a new method for treating free variables is proposed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 84
    ISSN: 1436-4646
    Keywords: Linear programming ; Mixed-integer programming ; Large-scale optimization ; Airline fleet assignment
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given a flight schedule and set of aircraft, the fleet assignment problem is to determine which type of aircraft should fly each flight segment. This paper describes a basic daily, domestic fleet assignment problem and then presents chronologically the steps taken to solve it efficiently. Our model of the fleet assignment problem is a large multi-commodity flow problem with side constraints defined on a time-expanded network. These problems are often severely degenerate, which leads to poor performance of standard linear programming techniques. Also, the large number of integer variables can make finding optimal integer solutions difficult and time-consuming. The methods used to attack this problem include an interior-point algorithm, dual steepest edge simplex, cost perturbation, model aggregation, branching on set-partitioning constraints and prioritizing the order of branching. The computational results show that the algorithm finds solutions with a maximum optimality gap of 0.02% and is more than two orders of magnitude faster than using default options of a standard LP-based branch-and-bound code.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 85
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 71 (1995), S. 77-100 
    ISSN: 1436-4646
    Keywords: Convex linearly constrained problems ; Variational inequalities ; Interior methods ; Entropy-like proximal method ; Maximal monotone operator
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper, an entropy-like proximal method for the minimization of a convex function subject to positivity constraints is extended to an interior algorithm in two directions. First, to general linearly constrained convex minimization problems and second, to variational inequalities on polyhedra. For linear programming, numerical results are presented and quadratic convergence is established.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 86
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 71 (1995), S. 29-50 
    ISSN: 1436-4646
    Keywords: Max-cut ; Cut polytope ; Metric polytope ; Linear relaxation ; One-third-integrality ; Box one-third-integrality ; Forbidden minor
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given a graphG = (V, E), the metric polytopeS (G) is defined by the inequalitiesx(F) − x(C∖F) ⩽ |F| − 1 for $$F \subseteq C$$ , |F| odd,C cycle ofG, and 0 ⩽x e ⩽ 1 fore ∈ E. Optimization overS (G) provides an approximation for the max-cut problem. The graphG is called 1/d-integral if all the vertices ofS(G) have their coordinates in{i/d ∣ 0 ⩽ i ⩽ d}. We prove that the class of 1/d-integral graphs is closed under minors, and we present several minimal forbidden minors for 1/3-integrality. In particular, we characterize the 1/3-integral graphs on seven nodes. We study several operations preserving 1/d-integrality, in particular, thek-sum operation for 0 ⩽k ⩽ 3. We prove that series parallel graphs are characterized by the following stronger property. All vertices of the polytopeS (G) ∩ {x ∣ ℓ ⩽ x ⩽ u} are 1/3-integral for every choice of 1/3-integral boundsℓ, u on the edges ofG.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 87
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 71 (1995), S. 101-112 
    ISSN: 1436-4646
    Keywords: Minmax ; Maximal covering problems ; Multi criteria decision-making
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we introduce the parametric minquantile problem, a weighted generalisation ofkth maximum minimisation. It is shown that, under suitable quasiconvexity assumptions, its resolution can be reduced to solving a polynomial number of minmax problems. It is also shown how this simultaneously solves (parametric) maximal covering problems. It follows that bicriteria problems, where the aim is to both maximize the covering and minimize the cover-level, are reducible to a discrete problem, on which any multiple criteria method may be applied.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 71 (1995), S. 71-76 
    ISSN: 1436-4646
    Keywords: Location theory ; Fermat—Weber problem ; Weiszfeld's iterative algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The Fermat—Weber location problem requires finding a point in ℝ N that minimizes the sum of weighted Euclidean distances tom given points. A one-point iterative method was first introduced by Weiszfeld in 1937 to solve this problem. Since then several research articles have been published on the method and generalizations thereof. Global convergence of Weiszfeld's algorithm was proven in a seminal paper by Kuhn in 1973. However, since them given points are singular points of the iteration functions, convergence is conditional on none of the iterates coinciding with one of the given points. In addressing this problem, Kuhn concluded that whenever them given points are not collinear, Weiszfeld's algorithm will converge to the unique optimal solution except for a denumerable set of starting points. As late as 1989, Chandrasekaran and Tamir demonstrated with counter-examples that convergence may not occur for continuous sets of starting points when the given points are contained in an affine subspace of ℝ N . We resolve this open question by proving that Weiszfeld's algorithm converges to the unique optimal solution for all but a denumerable set of starting points if, and only if, the convex hull of the given points is of dimensionN.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 89
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 71 (1995), S. 153-177 
    ISSN: 1436-4646
    Keywords: Network optimization ; Assignment problem ; Algorithms ; Experimental evaluation ; Cost scaling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow problems. In this paper we apply the method to the assignment problem and investigate implementations of the method that take advantage of assignment's special structure. The results show that the method is very promising for practical use.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 90
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 71 (1995), S. 195-206 
    ISSN: 1436-4646
    Keywords: Superfluous matrix ; Linear complementarity problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Superfluous matrices were introduced by Howe (1983) in linear complementarity. In general, producing examples of this class is tedious (a few examples can be found in Chapter 6 of Cottle, Pang and Stone (1992)). To overcome this problem, we define a new class of matrices $$\bar Z$$ and establish that in $$\bar Z$$ superfluous matrices of any ordern ⩾ 4 can easily be constructed. For every integerk, an example of a superfluous matrix of degreek is exhibited in the end.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 91
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 71 (1995), S. 249-258 
    ISSN: 1436-4646
    Keywords: Combinatorial optimization ; Integrality of polyhedra ; Generalized set packing ; Covering
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A 0, ±1-matrixA is balanced if, in every submatrix with two nonzero entries per row and column, the sum of the entries is a multiple of four. This definition was introduced by Truemper (1978) and generalizes the notion of a balanced 0, 1-matrix introduced by Berge (1970). In this paper, we extend a bicoloring theorem of Berge (1970) and total dual integrality results of Fulkerson, Hoffman and Oppenheim (1974) to balanced 0, ±1-matrices.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 92
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 71 (1995), S. 369-370 
    ISSN: 1436-4646
    Keywords: Local Lipschitz property ; Infinite-dimensional Hilbert space
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An oversight in a paper of Correa and Lemaréchal (this journal, 1993) is noted; a counterexample is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 93
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 70 (1995), S. 27-45 
    ISSN: 1436-4646
    Keywords: Convex polytopes ; Enumeration of faces ; Adjacency ; Segments
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We introduce the concept of a segment of a degenerate convex polytope specified by a system of linear constraints, and explain its importance in developing algorithms for enumerating the faces. Using segments, we describe an algorithm that enumerates all the faces, in time polynomial in their number. The role of segments in the unsolved problem of enumerating the extreme points of a convex polytope specified by a degenerate system of linear constraints, in time polynomial in the number of extreme points, is discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 94
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 70 (1995), S. 47-72 
    ISSN: 1436-4646
    Keywords: Bilevel programming ; Nonlinear nonconvex ; Nondifferentiable optimization ; Economic planning ; Sensitivity analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper is concerned with general nonlinear nonconvex bilevel programming problems (BLPP). We derive necessary and sufficient conditions at a local solution and investigate the stability and sensitivity analysis at a local solution in the BLPP. We then explore an approach in which a bundle method is used in the upper-level problem with subgradient information from the lower-level problem. Two algorithms are proposed to solve the general nonlinear BLPP and are shown to converge to regular points of the BLPP under appropriate conditions. The theoretical analysis conducted in this paper seems to indicate that a sensitivity-based approach is rather promising for solving general nonlinear BLPP.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 95
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 70 (1995), S. 123-148 
    ISSN: 1436-4646
    Keywords: Generalized equations ; Variational inequalities ; Nonlinear programming ; Sensitivity analysis ; Power series ; Strong regularity ; Constrained optimization ; Perturbation theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We show that the solution of a strongly regular generalized equation subject to a scalar perturbation expands in pseudopower series in terms of the perturbation parameter, i.e., the expansion of orderk is the solution of generalized equations expanded to orderk and thus depends itself on the perturbation parameter. In the polyhedral case, this expansion reduces to a usual Taylor expansion. These results are applied to the problem of regular perturbation in constrained optimization. We show that, if the strong regularity condition is satisfied, the property of quadratic growth holds and, at least locally, the solutions of the optimization problem and of the associated optimality system coincide. If, in addition the number of inequality constraints is finite, the solution and the Lagrange multiplier can be expanded in Taylor series. If the data are analytic, the solution and the multiplier are analytic functions of the perturbation parameter.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 96
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 70 (1995), S. 201-209 
    ISSN: 1436-4646
    Keywords: Disjoint paths ; Joins ; Packing cuts
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Seymour (1981) proved that the cut criterion is necessary and sufficient for the solvability of the edge-disjoint paths problem when the union of the supply graph and the demand graph is planar and Eulerian. When only planarity is required, Middendorf and Pfeiffer (1993) proved the problem to be NP-complete. For this case, Korach and Penn (1992) proved that the cut criterion is sufficient for the existence of a near-complete packing of paths. Here we generalize this result by showing how a natural strengthening of the cut criterion yields better packings of paths. Analogously to Seymour's approach, we actually prove a theorem on packing cuts in an arbitrary graph and then the planar edge-disjoint paths case is obtained by planar dualization. The main result is derived from a theorem of Sebő (1990) on the structure of ±1 weightings of a bipartite graph with no negative circuits.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 97
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 70 (1995), S. 279-351 
    ISSN: 1436-4646
    Keywords: Linear programming ; Complexity theory ; Interior-point methods ; Semi-definite programming ; Condition numbers ; Convex programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We propose analyzing interior-point methods using notions of problem-instance size which are direct generalizations of the condition number of a matrix. The notions pertain to linear programming quite generally; the underlying vector spaces are not required to be finite-dimensional and, more importantly, the cones defining nonnegativity are not required to be polyhedral. Thus, for example, the notions are appropriate in the context of semi-definite programming. We prove various theorems to demonstrate how the notions can be used in analyzing interior-point methods. These theorems assume little more than that the interiors of the cones (defining nonnegativity) are the domains of self-concordant barrier functions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 98
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 71 (1995), S. 17-28 
    ISSN: 1436-4646
    Keywords: Descent method ; Proximal algorithm ; Direction-finding subproblem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Most of the descent methods developed so far suffer from the computational burden due to a sequence of constrained quadratic subproblems which are needed to obtain a descent direction. In this paper we present a class of proximal-type descent methods with a new direction-finding subproblem. Especially, two of them have a linear programming subproblem instead of a quadratic subproblem. Computational experience of these two methods has been performed on two well-known test problems. The results show that these methods are another very promising approach for nondifferentiable convex optimization.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 99
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 71 (1995), S. 51-69 
    ISSN: 1436-4646
    Keywords: Smoothing ; Convex inequalities ; Linear complementarity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A smooth approximationp (x, α) to the plus function max{x, 0} is obtained by integrating the sigmoid function 1/(1 + e−αx ), commonly used in neural networks. By means of this approximation, linear and convex inequalities are converted into smooth, convex unconstrained minimization problems, the solution of which approximates the solution of the original problem to a high degree of accuracy forα sufficiently large. In the special case when a Slater constraint qualification is satisfied, an exact solution can be obtained for finiteα. Speedup over MINOS 5.4 was as high as 1142 times for linear inequalities of size 2000 × 1000, and 580 times for convex inequalities with 400 variables. Linear complementarity problems are converted into a system of smooth nonlinear equations and are solved by a quadratically convergent Newton method. For monotone LCPs with as many as 10 000 variables, the proposed approach was as much as 63 times faster than Lemke's method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 100
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 71 (1995), S. 127-136 
    ISSN: 1436-4646
    Keywords: Parametric optimization ; Mixed-integer program ; Value functions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We identify a class of formulas computable in polynomial time such that the functions defined by these formulas are precisely the value functions of mixed-integer programs with rational constraint coefficients.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...