ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Artikel  (41)
  • global optimization  (41)
  • Springer  (41)
  • American Chemical Society (ACS)
  • Cell Press
  • 2010-2014
  • 1995-1999  (40)
  • 1980-1984  (1)
  • Mathematik  (41)
  • Wirtschaftswissenschaften  (3)
Sammlung
  • Artikel  (41)
Datenquelle
Schlagwörter
Verlag/Herausgeber
Erscheinungszeitraum
Jahr
Thema
  • 1
    Digitale Medien
    Digitale Medien
    An intelligent decision support system for assisting industrial wastewater management (1995)
    Springer
    Annals of operations research 58 (1995), S. 455-477 
    Details
    ISSN: 1572-9338
    Schlagwort(e): Environment-economy integration ; industrial waste management ; “black box” systems design ; global optimization ; decision support systems
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Notizen: Abstract Sustainable economic development requires the inclusion of environmental factors in the decision making procedure. The generic objective of the Environmentally Sensitive Investment System (ESIS) Project is to provide industry and governmental departments or agencies with a tool to assess the technical and economic implications of capital-intensive projects, in response to stated environmental policies. More specifically, the ESIS prototype helps to find wastewater management alternatives that meet given environmental regulatory standards in a technologically sound and cost-efficient manner. The use of this decision support system will enhance the ability of managers and planners to explore the quantitative implications of a wide range of options. ESIS incorporates a combination of artificial intelligence and operations research techniques, database management and visualization tools, integrated under a graphical user interface. The ESIS prototype runs on top-of-the-line personal computers.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF02032381
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 2
    Digitale Medien
    Digitale Medien
    The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization (1996)
    Springer
    Annals of operations research 63 (1996), S. 151-188 
    Details
    ISSN: 1572-9338
    Schlagwort(e): Tabu search ; local search ; approximate algorithms ; heuristics ; global optimization ; stochastic minimization ; hybrid algorithms
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Notizen: Abstract A novel algorithm for the global optimization of functions (C-RTS) is presented, in which a combinatorial optimization method cooperates with a stochastic local minimizer. The combinatorial optimization component, based on the Reactive Tabu Search recently proposed by the authors, locates the most promising “boxes”, in which starting points for the local minimizer are generated. In order to cover a wide spectrum of possible applications without user intervention, the method is designed with adaptive mechanisms: the box size is adapted to the local structure of the function to be optimized, the search parameters are adapted to obtain a proper balance of diversification and intensification. The algorithm is compared with some existing algorithms, and the experimental results are presented for a variety of benchmark tasks.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF02125453
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 3
    Digitale Medien
    Digitale Medien
    The Cross-Entropy Method for Combinatorial and Continuous Optimization (1999)
    Springer
    Methodology and computing in applied probability 1 (1999), S. 127-190 
    Details
    ISSN: 1387-5841
    Schlagwort(e): combinatorial optimization ; global optimization ; importance sampling ; markov chain monte carlo ; simulated annealing ; simulation
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract We present a new and fast method, called the cross-entropy method, for finding the optimal solution of combinatorial and continuous nonconvex optimization problems with convex bounded domains. To find the optimal solution we solve a sequence of simple auxiliary smooth optimization problems based on Kullback-Leibler cross-entropy, importance sampling, Markov chain and Boltzmann distribution. We use importance sampling as an important ingredient for adaptive adjustment of the temperature in the Boltzmann distribution and use Kullback-Leibler cross-entropy to find the optimal solution. In fact, we use the mode of a unimodal importance sampling distribution, like the mode of beta distribution, as an estimate of the optimal solution for continuous optimization and Markov chains approach for combinatorial optimization. In the later case we show almost surely convergence of our algorithm to the optimal solution. Supporting numerical results for both continuous and combinatorial optimization problems are given as well. Our empirical studies suggest that the cross-entropy method has polynomial in the size of the problem running time complexity.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1010091220143
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 4
    Digitale Medien
    Digitale Medien
    Robust Estimation of Rotation Angles from Image Sequences Using the Annealing M-Estimator (1998)
    Springer
    Journal of mathematical imaging and vision 8 (1998), S. 181-192 
    Details
    ISSN: 1573-7683
    Schlagwort(e): deterministic annealing ; global optimization ; M-estimator ; motion analysis ; robust statistics
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract A robust method is presented for computing rotation angles of image sequences from a set of corresponding points containing outliers. Assuming known rotation axis, a least-squares (LS) solution are derived to compute the rotation angle from a clean data set of point correspondences. Since clean data is not guaranteed, we introduce a robust solution, based on the M-estimator, to deal with outliers. Then we present an enhanced robust algorithm, called the annealing M-estimator (AM-estimator), for reliable robust estimation. The AM-estimator has several attractive advantages over the traditional M-estimator: By definition, the AM-estimator involves neither scale estimator nor free parameters and hence avoids instabilities therein. Algorithmically, it uses a deterministic annealing technique to approximate the global solution regardless of the initialization. Experimental results are presented to compare the performance of the LS, M- and AM-estimators for the angle estimation. Experiments show that in the presence of outliers, the M-estimator outperforms the LS estimator and the AM-estimator outperforms the M-estimator.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1008281429730
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 5
    Digitale Medien
    Digitale Medien
    Bayesian testing of nonparametric hypotheses and its application to global optimization (1984)
    Springer
    Journal of optimization theory and applications 42 (1984), S. 31-50 
    Details
    ISSN: 1573-2878
    Schlagwort(e): Bayesian testing ; nonparametric inference ; random distribution functions ; global optimization
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Random distribution functions are the basic tool for solving nonparametric decision-theoretic problems. In 1974, Doksum introduced the family of distributions neutral to the right, that is, distributions such thatF(t 1),[F(t 2)−F(t 1)]/[1 −F(t 1)],...,[F(t k)−F(t k − 1)]/[1 −F(t k − 1)] are independent whenevert 1 〈 ... 〈t kIn practice, application of distributions neutral to the right has been prevented by the lack of a manageable analytical expression for probabilities of the typeP(F(t)〈q) for fixedt andq. A subclass of such distributions can be provided which allows for a close expression of the characteristic function of log[1−F(t)], given the sample. Then, thea posteriori distribution ofF(t) is obtained by numerical evaluation of a Fourier integral. As an application, the global optimization problem is formulated as a problem of inference about the quantiles of the distributionF(y) of the random variableY=f(X), wheref is the objective function andX is a random point in the search domain.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF00934132
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 6
    Digitale Medien
    Digitale Medien
    Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint (1996)
    Springer
    Journal of optimization theory and applications 91 (1996), S. 617-641 
    Details
    ISSN: 1573-2878
    Schlagwort(e): Lagrangian duality ; global optimization ; concave minimization ; penalty methods
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract This paper is concerned with the global optimization problem of minimizing a concave function subject to linear constraints and an additional facial reverse convex constraint. Here, the feasible set is the union of some faces of the polyhedron determined by the linear constraints. Several well-known mathematical problems can be written or transformed into the form considered. The paper addresses the Lagrangian duality of the problem. It is shown that, under slight assumptions, the duality gap can be closed with a finite dual multiplier. Finite methods based on solving concave minimization problems are also proposed. We deal with the advantages accrued when outer approximation, cutting plane, or branch-and-bound methods are used for solving these subproblems.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF02190124
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 7
    Digitale Medien
    Digitale Medien
    Multiplicative Programming Problems: Analysis and Efficient Point Search Heuristic (1997)
    Springer
    Journal of optimization theory and applications 94 (1997), S. 487-510 
    Details
    ISSN: 1573-2878
    Schlagwort(e): Multiplicative programming ; global optimization ; concave minimization ; efficient points ; heuristic algorithms ; multiple objectives
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Multiplicative programming problems are difficult global optimization problems known to be NP-hard. At the same time, these problems have some important applications in engineering, finance, economics, and other fields. This article has two purposes. The first is to present an analysis that shows several relationships between concave multiplicative programs and concave minimization problems, and between concave multiplicative programs and certain multiple-objective mathematical programs. The second purpose is to propose and report computational results for a heuristic efficient-point search algorithm that we have designed for use on linear multiplicative programming problems. To our knowledge, this is the first heuristic algorithm of its type. The theoretical and algorithmic results given in the article offer some potentially important new avenues for analyzing and solving multiplicative programming problems of various types.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1022600232285
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 8
    Digitale Medien
    Digitale Medien
    Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions (1995)
    Springer
    Journal of global optimization 6 (1995), S. 179-191 
    Details
    ISSN: 1573-2916
    Schlagwort(e): Product of two fractional functions ; global optimization ; branch and bound ; adaptive branching ; efficiency
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Two algorithms for finding a global minimum of the product of two affine fractional functions over a compact convex set and solving linear fractional programs with an additional constraint defined by the product of two affine fractional functions are proposed. The algorithms are based on branch and bound techniques using an adaptive branching operation which takes place in one-dimensional intervals. Results from numerical experiments show that large scale problems can be efficiently solved by the proposed methods.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01096767
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 9
    Digitale Medien
    Digitale Medien
    A D.C. optimization method for single facility location problems (1995)
    Springer
    Journal of global optimization 7 (1995), S. 209-227 
    Details
    ISSN: 1573-2916
    Schlagwort(e): Facility location ; d.c optimization ; global optimization ; nondifferentiable optimization
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract The single facility location problem with general attraction and repulsion functions is considered. An algorithm based on a representation of the objective function as the difference of two convex (d.c.) functions is proposed. Convergence to a global solution of the problem is proven and extensive computational experience with an implementation of the procedure is reported for up to 100,000 points. The procedure is also extended to solve conditional and limited distance location problems. We report on limited computational experiments on these extensions.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01097061
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 10
    Digitale Medien
    Digitale Medien
    On the longest circuit in an alterable digraph (1995)
    Springer
    Journal of global optimization 7 (1995), S. 279-295 
    Details
    ISSN: 1573-2916
    Schlagwort(e): Alterable digraphs ; global optimization ; approximation ; NP-hardness
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Analterable digraph is a digraph with a subset of its edges marked alterable and their orientations left undecided. We say that an alterable digraph has an invariant ofk on the length of the longest circuit if it has a circuit of length at leastk regardless of the orientations over its alterable edges. Computing the maximum invariant on the length of the longest circuit in an alterable digraph is aglobal optimization problem. We show that it is hard to approximate the global optimal solution for the maximum invariant problem.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01279452
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...