Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

CATS
2008

favoriteEmaildiscussreport

265views Applied Computing» more CATS 2008»

A Multidimensional Bisection Method for Unconstrained Minimization Problem

13 years 6 months ago

A Multidimensional Bisection Method for Unconstrained Minimization Problem

Download crpit.com

An extension of a new multidimensional bisection method for minimizing function over simplex is proposed for solving nonlinear unconstrained minimization problem. The method does not require a differentiability of function, and is guaranteed to converge to the minimizer for the class of strictly unimodal functions. The computational results demonstrating an effectiveness of algorithm for minimizing nonsmooth functions are presented.

Elena Morozova

Real-time Traffic

Applied Computing | CATS 2008 | Multidimensional Bisection Method | Nonlinear Unconstrained Minimization | Unimodal Functions |

claim paper

Related Content

» A Multidimensional Bisection Method for Minimizing Function over Simplex

» Cubic regularization of Newton method and its global performance

» Approximation schemes for Metric Bisection and partitioning

» Exact 1Norm Support Vector Machines Via Unconstrained Convex Differentiable Minimization

» An Unconstrained Multiphase Thresholding Approach for Image Segmentation

» Penalized Likelihood Transmission Image Reconstruction Unconstrained Monotonic Algorithms

» Newtons method and its use in optimization

» On VariableSized Multidimensional Packing

» Synthesis of faulttolerant feedforward neural networks using minimax optimization

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	CATS
Authors	Elena Morozova

Comments (0)