Rank: 6252 based on 10 downloads (last 30 days) and 1 file submitted
photo

Zeljko Bajzer

E-mail
Company/University
Mayo Clinic & Foundation

Personal Profile:

 

Watch this Author's files

 

Files Posted by Zeljko Bajzer
Updated   File Tags Downloads
(last 30 days)
Comments Rating
05 Mar 1999 simps The method is based on iterations of full-dimensional simplex calls Author: Zeljko Bajzer optimization, constrained, minimizer, fulldimensional, simplex 10 3
  • 5.0
5.0 | 3 ratings
Comments and Ratings on Zeljko Bajzer's Files View all
Updated File Comment by Comments Rating
08 Dec 2013 simps The method is based on iterations of full-dimensional simplex calls Author: Zeljko Bajzer Richi

More specifically, the approach is different for the else cases for fxr<fv(n+1). In your implementation, there is either a small contraction or small reflection or a multi-contration (shrink). In the original paper, shrinking can be combined with small reflection and small contration. However, this is only a minor difference from the original paper and will of course work.

07 Dec 2013 simps The method is based on iterations of full-dimensional simplex calls Author: Zeljko Bajzer Richi

Really good work. What is the basis for the approach? I saw, that the implementation is different from, e.g. Numerical Recepies. Is there a specific reason for this?

13 Jan 2012 simps The method is based on iterations of full-dimensional simplex calls Author: Zeljko Bajzer LIAO xj

21 May 2009 simps The method is based on iterations of full-dimensional simplex calls Author: Zeljko Bajzer Chris Men

Excellent work.

Contact us