## Models and Algorithms for Global Optimization: Essays Dedicated to Antanas Žilinskas on the Occasion of His 60th BirthdayAntanas ~ilinskas was born on January 5, 1946 in Lithuania. He graduated with a gold medal from 2nd Kaunas Gymnasium in 1963 and with a distinction diploma of Electrical Engineering from Kaunas University of Technology in 1968. His Ph. D. studies (aspirantur) at Lithuanian Academy of Sciences lasted from 1970 to 1973. The Candidate of Sciences (Ph. D. ) degree in Technical - bernetics (1973) has been received from Kaunas University of Technology. The Doctor of Mathematical Sciences degree (Habilitation, 1985) has been received from St. Petersburg (Leningrad) University. The title Senior Research Fellow (1980) has been conferred by the Presidium of Academy of Sciences, and the title Professor (1989) by Vilnius Pedagogical University. He has been awarded (with V. saltenis and G. Dzemyda) Lithuanian National Award for scientific achievements of 2001 for the research on "Efficient optimization methods and their applications". A. ~ilinskas joined the Institute of Mathematics and Informatics in 1973 starting with a position of junior research associate, worked as a senior - search associate reaching the highest rank of principal researcher which is his main position now. Apart from working in the research institute he was a lecturer at Vilnius Pedagogical University 1986-1988, where he founded a - partment of Informatics in 1988 and held a position of professor and head of this department 1988-1993. He worked later as a professor of this department until 2000. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

3 | |

SymmetryBased Approach | 21 |

Interval Algorithms | 43 |

Nonlinear Global Optimization Using Interval Arithmetic and Constraint Propagation | 45 |

A Case Study of Using IntervalMotivated Overestimators in Global Optimization | 59 |

for Continuous Constrained Optimization | 72 |

A Survey of Methods for the Estimation Ranges of Functions Using Interval Arithmetic | 97 |

Deterministic Optimization Models and Algorithms | 109 |

Nonadaptive Univariate Optimization for Observations with Noise | 185 |

Comparison of Estimation Procedures | 193 |

Multiparticle Simulated Annealing | 215 |

Educational Aspects | 223 |

On the Goodness of Global Optimisation Algorithms an Introduction into Investigating Algorithms | 225 |

Experimental Investigation of Distance Graduate Studies of the Open Source Environment by Models of Optimal Sequential Decisions and the Bayesi... | 249 |

Applications | 275 |

The Problem of Visual Analysis of Multidimensional Medical Data | 276 |

PseudoBoolean Optimization in Case of an Unconnected Feasible Set | 111 |

Univariate Algorithms for Solving Global Optimization Problems with Multiextremal Nondifferentiable Constraints | 123 |

Packing up to 200 Equal Circles in a Square | 141 |

Global Optimization of Network Length and Simulation of Film Evolution | 157 |

Stochastic Algorithms | 171 |

A Probabilistic Hybrid Differential Evolution Algorithm | 172 |

On Global Minimization in Mathematical Modelling of Engineering Applications | 299 |

A Two Step Hybrid Optimization Procedure for the Design of Optimal Water Distribution Networks | 311 |

PredictorBased Self Tuning Control with Constraints | 333 |

A TemplateBased MixedInteger Linear Programming Sequence Alignment Model | 343 |

361 | |

### Other editions - View all

Models and Algorithms for Global Optimization: Essays Dedicated to Antanas ... Aimo Törn,Julius Žilinskas No preview available - 2010 |

Models and Algorithms for Global Optimization: Essays Dedicated to Antanas ... Aimo Törn,Julius Žilinskas No preview available - 2006 |

### Common terms and phrases

Algorithm MSCP analysis Applications approach approximate asymptotic binary bitrate branch and bound calculated classifiers compression Computer consider constraint constraint propagation convergence convex corresponding criteria criterion defined denote discrete duality efficiency equations evaluations example feasible solution film evolution fractal dimension FSQP function value gap penalty genetic algorithm given global minimum global optimization global optimization algorithms global optimization problems graph implementation initial interval arithmetic iteration Kluwer linear estimators Lipschitz constants lower bound mathematical programming methods minimal minimum point multidimensional multiobjective node heads nonlinear number of function objective function obtained optimisation optimum order statistics packings parameters PHDE position position k probability random sample scheme Sect selection sequence alignment shift-invariant simulated annealing solving spanning tree stage standard interval arithmetic Steiner step stochastic techniques template theoretical tion trial points University vector visualization Zilinskas