# forum.alglib.net

ALGLIB forum
 It is currently Fri Jan 27, 2023 2:50 pm

 All times are UTC

### Forum rules

1. This forum can be used for discussion of both ALGLIB-related and general numerical analysis questions
2. This forum is English-only - postings in other languages will be removed.

 Page 1 of 1 [ 3 posts ]
 Print view Previous topic | Next topic
Author Message
 Post subject: BLEICPosted: Mon Aug 22, 2016 8:51 am

Joined: Fri Aug 05, 2016 11:48 am
Posts: 4
Is the effect of the scale parameter the same as solving the problem transformed to new variables (so that each new variable is the original divided by the scale)?

Why do I sometimes get termination type 4 even though I have set zero tolerance for gradient?
What is the tolerance for the gradient in this case and is it possible that I get will get a difference from optimum that exceeds epsx (taking scale into account)?

Is the algorithm affected by changing the objective function or one of the constraint equations/inequalities by a constant?

How is the tolerance for constraint violations determined exactly?

Why do I get termination type 7 sometimes? What can I do about it?

Thanks!

Top

 Post subject: Re: BLEICPosted: Mon Aug 22, 2016 2:53 pm

Joined: Fri May 07, 2010 7:06 am
Posts: 880
Hello!

philip wrote:
Is the effect of the scale parameter the same as solving the problem transformed to new variables (so that each new variable is the original divided by the scale)?

Yes, effect should be the same (however, because of rounding errors you still may get different results)

philip wrote:
Why do I sometimes get termination type 4 even though I have set zero tolerance for gradient?
What is the tolerance for the gradient in this case and is it possible that I get will get a difference from optimum that exceeds epsx (taking scale into account)?

It is possible that norm of constrained becomes exactly zero - say, when all constraints become active. In this case algorithm terminates with error 4, because, technically, zero<=zero. :)

philip wrote:
Is the algorithm affected by changing the objective function or one of the constraint equations/inequalities by a constant?

Theoretically - not affected. In practice - may be affected because of rounding errors.

philip wrote:
How is the tolerance for constraint violations determined exactly?

Currently ALGLIB uses fixed tolerance equal to 1E-6.

philip wrote:
Why do I get termination type 7 sometimes? What can I do about it?

Unfortunately, our hardware performs computations with finite precision (it would be good to have infinite precision floating point, but...). As result, sometimes you may get "gradient" vector which is NOT descent direction because rounding errors distorted its true value. Attempt to perform line search on such direction fails, and algorithm returns 7. Luckily, rounding errors are small and can "override" true gradient only near true solution. So, 7 signals successful termination.

Top

 Post subject: Re: BLEICPosted: Tue Aug 23, 2016 1:56 pm

Joined: Fri Aug 05, 2016 11:48 am
Posts: 4
Thank you!

Top

 Display posts from previous: All posts1 day7 days2 weeks1 month3 months6 months1 year Sort by AuthorPost timeSubject AscendingDescending
 Page 1 of 1 [ 3 posts ]

 All times are UTC

#### Who is online

Users browsing this forum: No registered users and 1 guest

 You cannot post new topics in this forumYou cannot reply to topics in this forumYou cannot edit your posts in this forumYou cannot delete your posts in this forumYou cannot post attachments in this forum

Search for: