Thread Links Date Links
Thread Prev Thread Next Thread Index Date Prev Date Next Date Index

Re: YES on Motion P1788/0019.01



Vladik (and P-1788):

Concerning your "major point":  Unless someone objects, I do not see a need to stop
discussion during the voting period.  In in-person meetings, one would need to do
so to maintain order, but in voting by email, there is no such need.  One thing
we cannot do is change the motion during the voting period.  (Of course, the proposer
can withdraw the motion during the voting period, to resubmit it later in altered
form.)  Of course, if someone knows this to be incorrect procedure, please inform me.

I see no problem exploring the possible contradiction during the voting period.

Best regards,

Baker

On 9/12/2010 15:30, Kreinovich, Vladik wrote:
Two comments:

1) minor point: since one can always easily move from one form to another (modulo infinite endpoints and modulo accuracy) if a problem is NP-hard it is NP-hard no matter what the representation is. I think what Dan means is that some algorithms using mid-rad are more efficient; Dan, please clarify and explain

2) major point: what is happening is that in effect, we continue the discussion instead of stopping it. Maybe it is beneficial to stop the voting and go back to discussion if this will influence our votes?

3) serious point: looks like what Arnold is saying is that Motion 19 contradicts to Motion 16. What if both are accepted? Maybe we should modify Motion 19 so that it include appropriate modification of Motion 16?

-----Original Message-----
From: stds-1788@xxxxxxxx [mailto:stds-1788@xxxxxxxx] On Behalf Of Dan Zuras Intervals

	I am moved by some papers on the subject to consider
	that we must find a way to make mid-rads both efficient
	&  well characterized.

	In particular, interval methods have a tendency to turn
	floating-point tasks into combinatorial tasks.  Thus,
	one sometimes has to look at exponentially many endpoints
	to find a tightest enclosure.

	There are linear algebra problems for which Jacobian
	methods exist that circumvent this problem.  At least to
	a good approximation&  only for the mid-rad forms.

	This means that some problems which are NP-hard for
	inf-sup forms are polynomial for mid-rad forms.

	It is this that gives merit to mid-rads for me.



--

---------------------------------------------------------------
R. Baker Kearfott,    rbk@xxxxxxxxxxxxx   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 993-1827 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
(Room 217 Maxim D. Doucet Hall, 1403 Johnston Street)
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------