From owner-reliable_computing Tue Jan 2 09:07:07 1996
Received: by interval.usl.edu id AA08830
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 2 Jan 1996 17:07:16 -0600
Received: from cs.utep.edu by interval.usl.edu with SMTP id AA08824
(5.65c/IDA-1.4.4 for ); Tue, 2 Jan 1996 17:07:12 -0600
Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1)
id AA02726; Tue, 2 Jan 96 16:07:07 MST
Date: Tue, 2 Jan 96 16:07:07 MST
From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich)
Message-Id: <9601022307.AA02726 [at] cs [dot] utep.edu>
To: reliable_computing [at] interval [dot] usl.edu
Subject: Applications of Interval Computations: a new book
Sender: owner-reliable_computing
Precedence: bulk
Applications of Interval Computations:
a new book published by Kluwer in January 1996
(from the Kluwer homepage)
ISBN: 0-7923-3847-2
edited by R. Baker Kearfott,
University of Southwestern Louisiana, Lafayette, USA,
Vladik Kreinovich,
University of Texas at El Paso, USA
(published in the Applied Optimization series,
Volume 3)
"Applications of Interval Computations" contains primarily
survey articles of actual industrial applications of numerical
analysis with automatic result verification and of interval
representation of data.
Underlying topics include:
* branch and bound algorithms for global optimization,
* constraint propagation,
* solution sets of linear systems,
* hardware and software systems for interval computations, and
* fuzzy logic.
Actual applications described in the book include:
* economic input-output models,
* quality control in manufacturing design,
* a computer-assisted proof in quantum mechanics,
* medical expert systems,
* and others.
A realistic view of interval
computations is taken: the articles indicate when and how
overestimation and other challenges can be overcome.
An introductory
chapter explains the content of the papers in terminology accessible
to mathematically literate graduate students. The style of the
individual, refereed contributions has been made uniform and
understandable, and there is an extensive book-wide index.
Audience: Valuable to students and researchers interested in
automatic result verification.
Detailed information, including
contents, contributors, and an order form can be found:
* on Kluwer homepage http://www.wkap.nl, or
* on the Interval Computations homepage
http://cs.utep.edu/interval-comp/main.html, in the "Books" section
The information on the Interval Computations homepage is basically
a mirror image of the Kluwer one (the only difference is that
the fonts are fancier).
From owner-reliable_computing Tue Jan 16 08:53:41 1996
Received: by interval.usl.edu id AA27152
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 16 Jan 1996 16:53:51 -0600
Received: from cs.utep.edu by interval.usl.edu with SMTP id AA27146
(5.65c/IDA-1.4.4 for ); Tue, 16 Jan 1996 16:53:48 -0600
Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1)
id AA21712; Tue, 16 Jan 96 15:53:42 MST
Date: Tue, 16 Jan 96 15:53:41 MST
From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich)
Message-Id: <9601162253.AA21712 [at] cs [dot] utep.edu>
To: reliable_computing [at] interval [dot] usl.edu
Subject: Brazil Interval Workshop: second announcement
Sender: owner-reliable_computing
Precedence: bulk
WAI'96 II WORKSHOP ON COMPUTER ARITHMETIC, INTERVAL AND
SYMBOLIC COMPUTATION
August 7-8, 1996
Recife - Pernambuco - Brazil
Call for Contributions
Second Announcement
THE WORKSHOP. The second Workshop on Computer Arithmetic,
Interval and Symbolic Computation has the
purpose to join researchers interested in scientific computation and
related topics to present and discuss recent advances on this
branch of computer science and its applications.
The major topics of interest include, but are not limited to: Theoretical
Foundations of the Computational Arithmetic, Interval Algorithms,
Interval/Arithmetic Co-processors, Interval Probability, Programming
Languages for Scientific Computation, Tools for Scientific Computation
and Symbolic Computation.
The workshop is part of a larger annual event being held in the campus of
the Federal University of Pernambuco on August 4-9, 1996:
the XVI Meeting of the Brazilian Computing Society. This meeting will
integrate a variety of events:
presentations of technical papers and invited talks, panels, tutorials,
research workshops and tool demonstrations.
SUBMISSIONS. One copy written in Portuguese, English
or Spanish with no more than 3 pages is requested for selection
purposes by e-mail to wai96 [at] di [dot] ufpe.br until
MARCH 15th, 1996. Format: preferably in TeX in a camera ready format;
A4 paper (297x210mm), leaving 25mm margins on each side; the first page
should include the title, author(s) identification,
author(s) affiliation; pages should not be numbered.
NOTIFICATION of ACCEPTANCE: April 30, 1996.
Refereed proceedings including full version of selected
paper will be published after conference in the
Revista de Inform\'atica Te\'orica e Aplicada
(Journal of Theoretical and Applied Computer Science).
THE LOCATION. Recife is one of the five biggest cities in Brazil.
The population of
Recife is 1.5 million inhabitants. Recife has marvellous beaches and
the temperature is around 29C throughout the whole year.
PROGRAMME COMMITTEE. B. de M. Acioly (Brazil), M. A. Campos (Brazil),
D. M. Claudio (Brazil), M. de B. Correia (Brazil), T. A. Diverio (Brazil),
V. Kreinovich (USA), R. D. Lins (Brazil), V. M. Nesterov (Russia),
M. A. C. de Oliveira (Brazil), W. L. Roque (Brazil),
S. M. Rump (Germany), J. Dias dos Santos (Brazil).
INFORMATION.
WAI96
Departamento de Inform\'atica
C.C.E.N. Av. Prof. Luiz Freire s/n
Cidade Universit\'aria
Recife - PE - BRAZIL
CEP 50732 - 970
e-mail: wai96 [at] di [dot] ufpe.br
Fax: (081)27108430, (081)2714925.
This information is also placed in the Forthcoming Conferences
section of the Interval Computations homepage
URL http://cs.utep.edu/interval-comp/main.html
From owner-reliable_computing Sun Jan 28 07:58:59 1996
Received: by interval.usl.edu id AA16585
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 28 Jan 1996 15:59:24 -0600
Received: from mailhost.lanl.gov by interval.usl.edu with SMTP id AA16579
(5.65c/IDA-1.4.4 for ); Sun, 28 Jan 1996 15:59:20 -0600
Received: from xdiv.lanl.gov by mailhost.lanl.gov (8.6.12/1.2)
id OAA24456; Sun, 28 Jan 1996 14:59:18 -0700
Received: from xdiv.lanl.gov.xdiv (angus.lanl.gov [128.165.123.30]) by xdiv.lanl.gov (8.6.12/8.6.12) with SMTP id OAA10145 for ; Sun, 28 Jan 1996 14:58:59 -0700
Date: Sun, 28 Jan 1996 14:58:59 -0700
From: "Rajendra B. Patil"
Message-Id: <199601282158.OAA10145 [at] xdiv [dot] lanl.gov>
Received: by xdiv.lanl.gov.xdiv (4.1/SMI-4.1)
id AA05153; Sun, 28 Jan 96 14:59:09 MST
To: reliable_computing [at] interval [dot] usl.edu
Subject: complexity
Reply-To: Raj Patil
Sender: owner-reliable_computing
Precedence: bulk
Hi:
I am looking for any references that has detail complexity analysis
of Interval Branch and Bound methods of for global optimization
over certain CLASS of optimization problems.
Also application of these techniques to resonably high
dimensional problems is also something I am looking for
(this ofcourse depends on the class of problems). Similarly
my efforts to apply these techniques to constrained problems
has not been very successful (in large dimensions) as the
box clustering effect is very dominating. Current algorithms
suggested in Ratschek and Rokne's, Hansen's book do not scale
to large dimensions and large set of constraints (even for
standard linear programming with 100 variables and 100
constraints).
Regards,
-------------------------------------------------------------
Raj Patil email: rbp1 [at] lanl [dot] gov
phone: (505)-667-2554
MS - F 645 fax : (505)-665-4479
XCM, Los Alamos National Laboratory
Los Alamos, NM 87545
------------- alternate address -----------------------------
P.O Box 1145
Los Alamos, NM 88003
-------------------------------------------------------------
From owner-reliable_computing Sun Jan 28 17:31:52 1996
Received: by interval.usl.edu id AA16891
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 28 Jan 1996 21:31:58 -0600
Received: from mathlab.math.ufl.edu by interval.usl.edu with SMTP id AA16885
(5.65c/IDA-1.4.4 for ); Sun, 28 Jan 1996 21:31:55 -0600
Received: from chaos.math.ufl.edu (chaos.math.ufl.edu [128.227.96.111]) by mathlab.math.ufl.edu (8.6.10/8.6.9) with ESMTP id WAA24765; Sun, 28 Jan 1996 22:31:52 -0500
From: Panos Pardalos
Received: (pardalos@localhost) by chaos.math.ufl.edu (8.6.10/8.6.9) id WAA18087; Sun, 28 Jan 1996 22:31:52 -0500
Date: Sun, 28 Jan 1996 22:31:52 -0500
Message-Id: <199601290331.WAA18087 [at] chaos [dot] math.ufl.edu>
To: rbp1 [at] lanl [dot] gov, reliable_computing [at] interval [dot] usl.edu
Subject: Re: complexity
Sender: owner-reliable_computing
Precedence: bulk
You can find a chapter on complexity issues of global optimization
in the "Handbook of Global Optimization" (Ed. R. Horst and P.M. Pardalos),
Kluwer Academic Publishers, (1995),
and in the book
P.M. Pardalos, "Complexity in Numerical Optimization",
World Scientific, (1993).
I hope this will help to answer some of your questions.
-P. Pardalos
From owner-reliable_computing Tue Jan 30 08:38:19 1996
Received: by interval.usl.edu id AA23798
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 30 Jan 1996 14:38:31 -0600
Received: from bp.ucs.usl.edu by interval.usl.edu with SMTP id AA23792
(5.65c/IDA-1.4.4 for ); Tue, 30 Jan 1996 14:38:28 -0600
Received: from rbk5287.usl.edu by bp.ucs.usl.edu with SMTP id AA02994
(5.65c/IDA-1.4.4 for ); Tue, 30 Jan 1996 14:38:19 -0600
Date: Tue, 30 Jan 1996 14:38:19 -0600
Message-Id: <199601302038.AA02994 [at] bp [dot] ucs.usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Light Version 1.5.2
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
To: Raj Patil
From: "R. Baker Kearfott"
Subject: Re: complexity
Cc: reliable_computing [at] interval [dot] usl.edu
Sender: owner-reliable_computing
Precedence: bulk
At 02:58 PM 1/28/96 -0700, Raj Patil wrote:
>Hi:
>
>I am looking for any references that has detail complexity analysis
>of Interval Branch and Bound methods of for global optimization
>over certain CLASS of optimization problems.
>
A "worst case" complexity analysis is discouraging, but that doesn't
mean the methods aren't practical -- the good problem spaces haven't
been adequately delineated, and many practical problems can be solved.
Caprini, Madsen, et al have done quite a bit of work in this area.
My review in the El Paso proceedings contains some pointers.
Also, I have placed a BibTex bibliography in:
pub/interval_math/bibliographies/optimization_book.bib
Please tell me if you see any errors in the above.
>Also application of these techniques to resonably high
>dimensional problems is also something I am looking for
>(this ofcourse depends on the class of problems).
That is a very open area.
>Similarly
>my efforts to apply these techniques to constrained problems
>has not been very successful (in large dimensions) as the
>box clustering effect is very dominating.
It depends on how you approach the problem. What are
"high dimensions?" I am presently polishing some software
for constrained problems, to be described in a forthcoming
book (towards the end of the year, or next year).
Have you tried the Fritz John system? I have found it is very
easy to get the derivative matrix wrong :-)
>Current algorithms
>suggested in Ratschek and Rokne's, Hansen's book do not scale
>to large dimensions and large set of constraints (even for
>standard linear programming with 100 variables and 100
>constraints).
You should include the constraints in a second-order fashion.
You should also use an approximate constrained optimizer to
get estimates, subsequently to be verified.
>
Best regards,
---------------------------------------------------------------
R. Baker Kearfott, rbk [at] usl [dot] edu (318) 482-5346 (fax)
(318) 482-5270 (work) (318) 981-9744 (home)
URL: ftp://interval.usl.edu/pub/interval_math/www/kearfott.html
Department of Mathematics, University of Southwestern Louisiana
---------------------------------------------------------------