Synopses & Reviews
This volume contains refereed papers based on lectures presented at the XIV International Conference on Mathematical Programming, held at Mátraháza, Hungary. The main purpose of the conference was to review and discuss recent advances and promising research trends concerning theory, algorithms, and applications in the fields of optimization theory, and related areas such as convex analysis, complementarity systems, and variational inequalities. Audience: Researchers in operations research, economics, mathematics, physics, and engineering.
Synopsis
This volume contains refereed papers based on the lectures presented at the XIV International Conference on Mathematical Programming held at Matrahaza, Hungary, between 27-31 March 1999. This conference was organized by the Laboratory of Operations Research and Deci- sion Systems at the Computer and Automation Institute, Hungarian Academy of Sciences. The editors hope this volume will contribute to the theory and applications of mathematical programming. As a tradition of these events, the main purpose of the confer- ence was to review and discuss recent advances and promising research trends concerning theory, algorithms and applications in different fields of Optimization Theory and related areas such as Convex Analysis, Complementarity Systems and Variational Inequalities. The conference is traditionally held in the Matra Mountains, and housed by the resort house of the Hungarian Academy of Sciences. This was the 14th event of the long lasting series of conferences started in 1973. The organizers wish to express their thanks to the authors for their contributions in this volume, and the anonymous referees for their valu- able comments. Special thanks are directed to our sponsors, the Hun- garian Academy of Sciences, the National Committee for Technological Development, the Hungarian National Science Foundation, and last but not least, the Hungarian Operational Research Society. We would like to thank John Martindale from Kluwer Academic Publishers for helping us produce this volume, Eva Nora Nagy for cor- rections and proof-readings, and Peter Dombi for his excellent work on typesetting and editing the manuscript.
Table of Contents
Preface. Heuristics for the Process Network Synthesis Problem; Z. Blázsik, et al. Heuristics for Simplified Process Network Synthesis (PNS) Problems with a Blossom-Type Algorithm for the Edge Covering Problem; Z. Blázsik, et al. Lower and Upper Bounds on the Probability of the Union of Some Events with Applications; J. Bukszár. The Linear Complementarity Problem and the Class of Generalized Positive Subdefinite Matrices; J.-P. Crouzeix, S. Komlósi. Computer Experiences with Successive Regression Approximations for Solving Equations; I. Deák. A Bundle of Smooth Lagrangians in Mathematical Programming; V.F. Demyanov. A Nontopological Two-function Minimax Theorem with Monotone Transformations of the Functional Values; F. Forgó. Non-smooth Optimization with Randomization; L. Gerencsér, Zs. Vágó. The Sherman-Morrison Formula for the Determinant and its Application for Optimizing Quadratic Functions on Condition Sets Given by Extreme Generators; G. Kéri. Duality for D.C. Optimization Over Campact Sets; J.-E. Martinez-Legaz, M. Volle. Characterization of Monotone Operators by Using a Special Class of Preinvex Functions; S.Z. Németh. Two Approaches for Parallelizing the UEGO Algorithm; P.M. Ortigosa, et al. Convexification of Functions by Nonlinear Coordinate Transformations; T. Rapcsák. Packing Equal Circles in a Square I. - Problem Setting and Bounds for Optimal Solutions; P.G. Szabó, et al. Packing Equal Circles in a Square II. - New Results for up to 100 Circles Using the TAMSASS-PECS Algorithm; L.G. Casado, et al. On Duality for Quasi-convex Supremization and Reverse Convex Infimization; I. Singer. A Minimization Problem in Function Spaces; B. Uhrin.