Optimization Theory

1. Front Matter

   Pages i-vii

   PDF

2. Heuristics for the Process Network Synthesis Problem

   • Z. Blázsik, Cs. Holló, Cs. Imreh, Z. Kovács

   Pages 1-17

3. Heuristics for Simplified Process Network Synthesis (PNS) Problems with a Blossom-Type Algorithm for the Edge Covering Problem

   • Zoltán Blázsik, Kornél Keserű, Zoltán Kovács

   Pages 19-31

4. Lower and Upper Bounds on the Probability of the Union of Some Events with Applications

   • József Bukszár

   Pages 33-43

5. The Linear Complementarity Problem and the Class of Generalized Positive Subdefinite Matrices

   • Jean-Pierre Crouzeix, Sándor Komlósi

   Pages 45-63

6. Computer Experiences with Successive Regression Approximations for Solving Equations

   • István Deák

   Pages 65-80

7. A Bundle of Smooth Lagrangians in Mathematical Programming

   • V. F. Demyanov

   Pages 81-98

8. A Nontopological Two-function Minimax Theorem with Monotone Transformations of the Functional Values

   • Ferenc Forgó

   Pages 99-110

9. Non-smooth Optimization with Randomization

   • László Gerencsér, Zsuzsanna Vágó

   Pages 111-117

10. The Sherman-Morrison Formula for the Determinant and its Application for Optimizing Quadratic Functions on Condition Sets Given by Extreme Generators

    • Gerzson Kéri

    Pages 119-138

11. Duality For D.C. Optimization Over Compact Sets

    • Juan-Enrique Martinez-Legaz, Michel Volle

    Pages 139-146

12. Characterization of Monotone Operators by Using a Special Class of Preinvex Functions

    • S. Z. Németh

    Pages 147-157

13. Two Approaches for Parallelizing the UEGO Algorithm

    • P. M. Ortigosa, I. García, M. Jelásity

    Pages 159-177

14. Convexification of Functions by Nonlinear Coordinate Transformations

    • T. Rapcsák

    Pages 179-189

15. Packing Equal Circles in a Square I. — Problem Setting and Bounds for Optimal Solutions

    • P. G. Szabó, T. Csendes, L. G. Casado, I. García

    Pages 191-206

16. Packing Equal Circles in a Square II. — New Results for up to 100 Circles Using the TAMSASS-PECS Algorithm

    • L. G. Casado, I. García, P. G. Szabó, T. Csendes

    Pages 207-224

17. On Duality for Quasi-convex Supremization and Reverse Convex Infimization

    • I. Singer

    Pages 225-254

18. A Minimization Problem in Function Spaces

    • B. Uhrin

    Pages 255-278

19. Back Matter

    Pages 279-280

    PDF

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.

• algorithms
• Approximation
• calculus
• computer
• inequality
• Mathematica
• operations research
• optimization
• probability
• programming
• matrix theory

• Department of Mathematics, University of Pisa, Pisa, Italy

  Franco Giannessi

• Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA

  Panos Pardalos

• Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary

  Tamás Rapcsák

Policies and ethics