Recent Publications, Reports

Recent Talks

Books

C. Roos, T. Terlaky and J.-Ph. Vial: Interior Point Approach to Linear Optimization: Theory and Algorithms, John Wiley & Sons, New York, 1997 (second print 1998).
J. Peng, C. Roos and T. Terlaky Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms Princeton University Press, Princeton, New Jessy, 2002.

Edited Books, Volumes

  1. T. Terlaky (editor): Interior Point Methods in Mathematical Programming, Kluwer Academic Publisher, Dordrecht, The Netherlands 1996.
  2. C. Roos and T. Terlaky (Guest editors): Special issue of Applied Numerical Mathematics Vol 29(3), Elsevier. dedicated to the HPOPT-I workshop held in Delft, 19-20 September 1996.
  3. F. Potra, C. Roos and T. Terlaky (Guest editors): Optimization Methods and Software A special issue on Interior Point Methods, Vol.11 & 12. (1999), Gordon and Breach.
  4. J.B.G. Frenk, C. Roos, T. Terlaky and S. Zhang (editor): High Performance Optimization, Kluwer Academic Publisher, Dordrecht, The Netherlands 1999.

Contributions to Books

  1. Interior Point Methodology for Linear Programming: Duality, Sensitivity Analysis and Computational Aspects (1993) in Optimization in Planning and Operation of Electric Power Systems, Eds. K. Frauendorfer, H. Glavitsch and R. Bacher. Physica--Verlag, 57--124. (Joint work with B. Jansen, C. Roos and J.-Ph. Vial).
  2. Adding and Deleting Constraints in the Path--Following Method for Linear Programming (1994) in Advances in Optimization and Approximation, eds. D.Du and J. Sun, 166--185. (Joint work with D. den Hertog and C. Roos).
  3. Computational View of Interior Point Methods (1996) in Advances in Linear and Integer Programming , Ed. J. Beasley. Oxford University Press, Oxford, England, 103--144. (Joint work with J. Gondzio).
  4. Target-following algorithms for linear programming (1996) In T.Terlaky, editor, Interior Point Methods of Mathematical Programming, pages 83--124. Kluwer Academic Publishers, Dordrecht, The Netherlands. (Joint work with B.Jansen and C.Roos.)
  5. Introduction to the theory of interior point methods (1996) in T.Terlaky, editor, Interior Point Methods of Mathematical Programming, pages 3--34. Kluwer Academic Publishers, Dordrecht, The Netherlands. (Joint work with B.Jansen and C.Roos.)
  6. Advances in linear optimization (1997) in M. Del. Amico, F. Maffioli, S. Martello, editors, Annotated Bibliographies in Combinatorial Optimization, pages 95--114. John Wiley and Sons, (Joint work with C.Roos.)
  7. The optimal set and optimal partition approach (1997) Chapter 6 in: H.J. Greenberg and T. Gal, editors, Advances in Sensitivity Analysis and Parametric Programming. Kluwer Academic Publishers, Dordrecht, The Netherlands. (Joint work with A.B. Berkelaar and C.Roos).
  8. Polynomial affine scaling algorithms for P*(k) linear complementarity problems (1997) in Lecture Notes in Economics and Mathematical Systems Vol. 452. Springer Verlag. Eds. P. Grintzman, R. Horst, E. Sacs and R. Tichatschke, Recent Advances in Optimization 119--137. (Joint work with T.Illés and C.Roos).
  9. A short survey on semidefinite programming (1997) in CWI TRACT Vol 122, Eds. W.K. Klein Haneveld, O.J. Vrieze, L.C.M. Kallenberg, Ten Years of LNMB, Ph.D. research and graduate courses of the Dutch Network of Operations Research, 323--339. (Joint work with E. de Klerk and C.Roos).
  10. On primal--dual path--following algorithms for semidefinite programming (1998) In New Trends in Mathematical Programming, 137--157. Proceedings of XIII. International Conference on Mathematical Programming, Mátraháza, Hungary. Eds. F. Gianessi, T. Rapcsák and S. Komlósi, Kluwer Academic Publishers (1998) (Joint work with E. de Klerk and C.Roos).
  11. Infeasible--start semidefinite programming algorithms via self-dual embeddings, (1998). In: Fields Institute Communications, Vol. 18, American Mathematical Society (1998) ISBN: 0-8218-0825-7. Eds. H. Wolkowicz and P.M. Pardalos: Topics in Semidefinite and Interior Point Methods, 215--237. (Joint work with E.deKlerk and C.Roos).
  12. New complexity analysis of primal--dual Newton methods for P*(k) linear complementarity problems. In High Performance Optimization Techniques 245--266. Eds.: J.B.G. Frenk, C. Roos, T. Terlaky and S. Zhang. Kluwer Academic Publishers, Dordrecht (1999). (Joint work with J. Peng and C.Roos).
  13. A logarithmic barrier approach to Fischer function. In Nonlinear Optimization and Applications 277--298. Eds.: G. di Pillo and F. Gianessi. Kluwer Academic Publishers, Dordrecht (1999). (Joint work with J. Peng and C.Roos).
  14. A simple treatment of the theory of interior point methods (In memoriam György Sonnevend). In New Roads in the Hungarian Operations Research Eds.: S. Komlósi and T. Szántai. Dialog Campus P.C. Pécs, Hungary (1999) 97--131. In Hunagrian.
  15. Least index anti-cycling rules. To appear in Enciclopedia of Optimization, P.M. Pardalos and C. Fludas (eds.), Kluwer Academic Publishers, 1999.
  16. Principal pivoting methods for linear complementarity problems. To appear in Enciclopedia of Optimization, P.M. Pardalos and C. Fludas (eds.), Kluwer Academic Publishers, 1999.
  17. Criss-Cross pivoting rules. To appear in Enciclopedia of Optimization, P.M. Pardalos and C. Fludas (eds.), Kluwer Academic Publishers, 1999.
  18. Lexicographic pivoting rules. To appear in Enciclopedia of Optimization, P.M. Pardalos and C. Fludas (eds.), Kluwer Academic Publishers, 1999.
  19. Interior-point methods. To appear in Enciclopedia of Operations Research, S. Gass and C. Harris (eds.), Kluwer Academic Publishers, 1999. (Joint work with P. Boggs.)
  20. A homogenized cutting plane method to solve the convex feasibility problem. (Joint work with J.E. Mitchell, E.D. Andersen and C. Roos). (To appear in the proceedings of the NLPVI conference: Optimization methods and applications, Eds. X.Q. Yang, K.L. Teo, and L. Caccetta.)
  21. Linear Programming: Introduction. To appear in Handbook of Applied Optimization Eds.: P.M. Pardalos and M.G.C. Resende. Oxford University Press, 2000.
  22. Simplex-type algorithms. To appear in Handbook of Applied Optimization Eds.: P.M. Pardalos and M.G.C. Resende. Oxford University Press, 2000.
  23. Self-dual embeddings, . In: Handbook of Semidefinite Programming, (2000) Vol. 27 in: International Series in Operations research and Management Science Series editor F.S. Hillier Volume: 27 ISBN: 07923-7771-0. Eds. H. Wolkowicz R. Saigal and L. Vandenberghe, 111--138. Kluwer Academic Publishers, 2000. (Joint work with E.deKlerk and C.Roos).

Publications in Refereed Journals

Publications in English

  1. On lp Programming (1985) European Journal of Operational Research 22. 70--100.
  2. Smoothing Empirical Functions by lp Programming (1986) European Journal of Operational Research 27. 343--363.
  3. A Convergent Criss--Cross Method (1985) Mathemathische Operationsforschung und Statistics ser. Optimization 16. 5. 683--690.
  4. A Finite Criss--Cross Method for Oriented Matroids (1987) Journal of Combinatorial Theory B 42, No.3. 319--327.
  5. A New Algorithm for Quadratic Programming (1987) European Journal of Operational Research Vol. 32. No. 2. 294--301.
  6. Variants of the Hungarian Method for Linear Programming (1989) Mathemathische Operationsforschung und Statistics ser. Optimization 20. No.1. 79--91. (Joint work with E. Klafszky)
  7. Remarks on the Feasibility Problems of Oriented Matroids (1987) Annales Uni-versitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae Sectio Computatorica Tom VII. 155--157. (Joint work with E. Klafszky)
  8. The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra (1991) Linear Algebra and Its Applications 151. 97--118. (Joint work with E. Klafszky)
  9. Some Generalizations of the Criss--Cross Method for Quadratic Programming (1992) Mathemathische Operationsforschung und Statistics ser. Optimization 24. 127--139. (Joint work with E. Klafszky)
  10. Some Generalizations of the Criss--Cross Method for the Linear Complementarity Problem of Oriented Matroids (1989) Combinatorica 9 (2) 189--198. (Joint work with E. Klafszky)
  11. Linearly Constrained Estimation by Mathematical Programming (1989) European Journal of Operations Research 254--267. (Joint work with E. Klafszky and J. Mayer)
  12. A New Convergent Algorithm for the Continuous Modular Design Problem, (1990) The Arabian Journal for Science and Engineering 15. No. 4B. 687--694. (Joint work with E. Klafszky and J. Mayer)
  13. A Geometric Programming Approach to the Channel Capacity Problem, (1992) Engineering Mathematics 19. 115--130. (Joint work with E. Klafszky and J. Mayer)
  14. A Large--Step Analytic Center Method for a Class of Smooth Convex programming problems. (1992) SIAM Journal on Optimization 2. No.1 55-70. (Joint work with D. den Hertog and C. Roos)
  15. A Potential Reduction Variant of Renegar's Short--Step Path--Following Method for Linear Programming (1991) Linear Algebra and Its Applications 68. 43--68. (Joint work with D. den Hertog and C. Roos)
  16. A Polynomial Method of Weighed Centers for Convex Quadratic Programming (1991) Journal of Information and Optimization Sciences 12. 187--205. (Joint work with D. den Hertog and C. Roos)
  17. On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems (1992) JOTA 73, 1--25. (Joint work with D. den Hertog and C. Roos)
  18. A Build--Up Variant of the Path--Following Method for LP (1992) Operations Research Letters 12. 181--186. (Joint work with D. den Hertog and C. Roos)
  19. Linear Complementarity and Oriented Matroids (1992) Japanese Journal of Operations Research 35. 45--61. (Joint work with K. Fukuda) Selected as "The best OR paper of the year 1992" by The Operations Research Society of Japan.
  20. On the Monotonicity of the Dual Objective Along Barrier Path (1992) COAL Bulletin 20. 2--8. (Joint work with D. den Hertog and C. Roos)
  21. The Linear Comlementarity Problem, Sufficient Matrices and the Criss--Cross Method (1993) Linear Algebra and Its Applications, 187. 1--14. (Joint work with D. den Hertog and C. Roos)
  22. A Long Step Barrier Method for Convex Quadratic Programming (1993) Algorithmica, 10. 365--382. (Joint work with K.M. Anstreicher, D. den Hertog and C. Roos)
  23. A Monotonic Build-Up Simplex Algorithm (1994) Operations Research 42. 556--561. (Joint work with K.M. Anstreicher)
  24. Degenerac y in Interior Point Methods (1993) Annales of Operations Research, 46, 107--138. (Joint work with D. den Hertog, O. Güler, C. Roos and T. Tsuchiya)
  25. Pivot Rules for Linear Programming -- A Survey (1993) Annales of Operations Research 46, 203--233. (Joint work with S. Zhang)
  26. Inverse Barrier Methods for Linear Programming (1994) Revue RAIRO -- Operations Research 28. 135--163. (Joint work with D. den Hertog and C. Roos)
  27. The Theory of Linear Programming: Skew Symmetric Self--Dual Problems and the Central Path (1993) Optimization 29. 225--233. (Joint work with B. Jansen and C. Roos)
  28. Primal--Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method (1994) Journal of Optimization Theory and Applications 83. 1--26. (Joint work with B. Jansen, C. Roos and J.-Ph. Vial)
  29. Pseudoconvex Optimization for a Special Problem of Paint Industry (1994) European Journal of Operations Research 79, 537--548. (Joint work with T. Illés and J. Mayer)
  30. A Logarithmic Barrier Cutting Plane Method for Convex Programming, (1995). Annals of Operations Research 58, 69--98. (Joint work with D. den Hertog, J. Kaliski and C. Roos)
  31. A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming (1995) Management Science, 41, 1922--1934. (Joint work with O. Güler, C. Roos and J.-Ph. Vial)
  32. A Sufficient Condition for Self--Concordance with Application to Some Classes of Structured Convex Programming Problems (1995) Mathematical Programming 69, 75--88. (Joint work with D. den Hertog, F. Jarre and C. Roos)
  33. An Investigation of Interior Point Algorithms for the Linear Transportation Problems (1993) SIAM Journal on Computing 17.5. 1202--1223. (Joint work with L. Portugal, F. Bastos, J. Judice and J. Paixö)
  34. A Polynomial Dikin--Type Primal--Dual Algorithm for Linear Programming (1996) Mathematics of Operations Research 21. 341--353. (Joint work with B. Jansen and C. Roos)
  35. Improved Complexity Using Higher-Order Correctors for Primal--Dual Dikin Affine Scaling (1996) Mathematical Programming 76.1. 117--130. (Joint work with B. Jansen, C. Roos and Y. Ye).
  36. Primal-dual Target-following Algorithms for Linear Programming (1996). Annals of Operations Research, 62:197--231. (Joint work with B.Jansen, C.Roos and J.-Ph. Vial.)
  37. Interior Point Methods, a Decade After Karmarkar -- a Survey With Application to the Smallest Eigenvalue Problem (1996). Statistica Neerlandica, 50:146--170. (Joint work with B.Jansen and C.Roos.)
  38. Optimization of Nuclear Reactor Reloading Patterns (1997) Annals of Operations Research, Vol.69, 65--84. (Joint work with E. de Klerk, T. Illés, A. de Jong, C. Roos, J. Valkó and J.E. Hoogenboom).
  39. Long-step primal-dual target-following algorithms for linear programming (1996). Mathematical Methods of Operations Research, 44:11--30. (Joint work with B.Jansen, C.Roos and J.-Ph. Vial).
  40. A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems (1997), SIAM Journal on Optimization Vol. 7. No. 1. 126--140. (Joint work with B. Jansen and C. Roos).
  41. Inverse barriers and CES-functions in linear programming (1997). Operations Research Letters, 20, 15--20. (Joint work with H.van Maaren).
  42. Initialization in semidefinite programming via a self-dual, skew-symmetric embedding. (1997) Operations Research Letters, Vol. 20, No.5, 213--221. (Joint work with E.deKlerk and C.Roos).
  43. Criss-cross methods: A fresh view on pivot algorithms. (1997) Mathematical Programming Series B, Vol 79, Nos. 1--3, 369--395. (Joint work with K. Fukuda).
  44. Polynomiality of primal--dual affine scaling algorithms for nonlinear complementarity problems (1997). Mathematical Programming, 315--345. (Joint work with B. Jansen, C. Roos and A. Yoshise).
  45. Polynomial primal-dual affine scaling algorithms in semidefinite programming (1998). Journal of Combinatorial Optimization, Vol, 2, 51--69. (Joint work with E.deKlerk, C.Roos).
  46. A Potential Reduction Approach to the Frequency Assignment Problem (1997). Discrete Applied Mathematics 78, 252--282.. (Joint work with B. Jansen, C. Roos and J. Warners).
  47. Potential Reduction Algorithms for Structured Combinatorial Optimization Problems (1997). Operations Research Letters, 21, 2. 55--65. (Joint work with B. Jansen, C. Roos and J. Warners).
  48. Method of approximate centers for semi-definite programming (1997). Optimization Methods and Software, 7, 291--309. (Joint work with B. He, E. de Klerk and C.Roos).
  49. Sensitivity analysis in linear programming: just be careful! (1997). European Journal of Operations Research, Vol 101 15--28. (Joint work with B.Jansen, J.J. deJong and C.Roos).
  50. Logarithmic barrier decomposition methods for semi-infinite programming (1997). International Transactions in Operations Research 4/4 285--303. (Joint work with J.Kaliski, D.Haglin and C.Roos).
  51. Computing Maximum Likelihood Estimators of Convex Density Functions (1998). SIAM Journal on Scientific Computing Vol.19. No.2. 675--694. (Joint work with J.-Ph. Vial).
  52. A nonconvex weighted potential function for polynomial target following methods (1998). Annals of Operations Research, 81. 3--14. (Joint work with E.deKlerk and C.Roos).
  53. Primal--dual potential reduction methods for semidefinite programming using affine--scaling directions (1999). Applied Numerical Mathematics, 29(3) 335--360. A special issue devoted to the HPOPT-I workshop held in Delft, 19-20 September 1996. (Joint work with E. de Klerk and C.Roos).
  54. Copositive relaxation for general quadratic programming (1998). Optimization Methods and Software, Vol.9. 185--209. (Joint work with A.J. Quist, E. deKlerk and C. Roos).
  55. Application of nonlinear optimization to reactor core fuel reloading. Annals of Nuclear Energy, 26, 423-448 (1999) (Joint work with A.J. Quist, E. de Klerk, C. Roos, R. van Geemert, J.E. Hoogenboom and T. Illés).
  56. Complexity analysis of a logarithmic barrier decomposition method for semi-infinite linear programming (1999). Applied Numerical Mathematics Vol 29(3). 379--395. Special issue dedicated to the HPOPT-I workshop held in Delft, 19-20 September 1996. (Joint work with Z.-Q. Luo and C.Roos).
  57. On the dimension of the set of rim perturbations for optimal partition invariance (1999). SIAM Journal on Optimization Vol. 9. No. 1. 207--216. (Joint work with H.J. Greenberg, A.G. Holder and C.Roos).
  58. Finding optimal nuclear reactor core reload patterns using nonlinear optimization and search heuristics. To apear in Engineering Optimization ?? (1999) (Joint work with A.J. Quist, E. de Klerk, C. Roos, R. van Geemert, J.E. Hoogenboom and T. Illés).
  59. A finite criss-cross method for hyperbolic programming. European Journal of Operations Research 198--214 (1999). (Joint work with T.Illés and Á. Szirmai).
  60. On the Ellipsoid Method. Radovi Mathematicki vol.8. 269--280 (1992). (Joint work with E. Klafszky).
  61. A strongly polynomial rounding procedure yielding a maximally complementary solution for P*(k) linear complementarity problems. To appear in SIAM Journal on Optimization (2000). (Joint work with T. Illés, J. Peng and C.Roos).
  62. On maximization of quadratic forms over intersection of ellipsoids with common center. Mathematical Programming 86 (1999) 3. 463-473. (Joint work with A. Nemirovskii and C.Roos).
  63. Note on a paper of Broyden. Operations Research Letters Vol. 25. No. 4. 183--186 (1999). (Joint work with C.Roos).
  64. A note on Mascarenhas' counter example about global convergence of the affine scaling algorithm. To appear in Applied Mathematics and Optimization (1999). (Joint work with T. Tsuchiya).
  65. Basis- and tripartition identification for quadratic programming and linear complementarity problems. From an interior point solution to an optimal basis and vice versa. Mathematical Programming 86. (1999) 2, 261-282. (Joint work with A.B. Berkelaar, B. Jansen and C.Roos).
  66. The Difference between the Managerial and Mathematical Interpretation of Sensitivity Analysis Results in Linear Programming. (Joint work with T. Koltai). (To appear in International Journal on Production Economics)
  67. A new complexity analysis of the primal-dual Newton method for linear optimization. (To appear in Annales of Operations Research) (Joint work with J. Peng and C.Roos).
  68. On copositive programming and standard quadratic optimization problems (2000). Journal of Global Optimization,To appear. (Joint work with I.M. Bomze, M. Duerr, E. de Klerk, C. Roos and A.J. Quist,).
  69. On the existence of short admissible pivot sequences for feasibility and liner optimization problems. (Joint work with K. Fukuda). (Submitted to Mathematical Programming)
  70. Technical Report 98-48, Faculty of Mathematics and Computer Science, TU Delft, NL--2628BLDelft, The Netherlands, 1999.
  71. An Easy Way to Teach Interior Point Methods (2000) To appear in European Journal of Operational Research ??. ??--??.

Publications in Spanish

El Papel de la Tecnica del Pivote en la Demostracion de Algunos Teoremas Fundamentales del Algebra Lineal (1989) Revista de Investigacion Operational X No. 3. 141--167. (Joint work with E. Klafszky)

Publications in Hungarian

  1. On lp Programming (1980) Alkalmazott Matematikai Lapok 6. 27--63.
  2. A New Proof for the Weak Duality Theorem of Geometrical and lp Programming (1984) Alkalmazott Matematikai Lapok 10. 283--288.
  3. Smoothing Empirical Functions by lp Programming (1984) Alkalmazott Matematikai Lapok 10. 323--352.
  4. A Finite Criss--Cross Method for Linear Programming and the Proof of its Finiteness (1984) Alkalmazott Matematikai Lapok 10. 289--296.
  5. The Finite Criss--Cross Method and Oriented Matroid Programming (1985) Alkalmazott Matematikai Lapok 11. 385--398.
  6. Methods of "Hungarian Type" for Solving Linear Programming Problems, (1985) Alkalmazott Matematikai Lapok 11. 1--14. (Joint work with E. Klafszky)
  7. A New Algorithm for Quadratic Programming (1986) Alkalmazott Matematikai Lapok 12. 283--293.
  8. A New Approach to the Feasibility Problems of Oriented Matroids, (1986) Alkalmazott Matematikai Lapok 12. 279--282. (Joint work with E. Klafszky)
  9. Bland's Rule for the Primal and Dual Simplex Method, (1987) Alkalmazott Matematikai Lapok 13. 1--5. (Joint work with E. Klafszky)
  10. Criss--Cross Methods and the Linear Complementarity Problem of Oriented Matroids (1989) Alkalmazott Matematikai Lapok 14. 365--375. (Joint work with E. Klafszky)
  11. On the Mathematical Programming Models of Mixing (1989) Alkalmazott Ma-te-matikai Lapok 14. 99--117. (Joint work with J. Mayer and E. Klafszky)
  12. Pivoting in Linear Algebra (1989) Alkalmazott Matematikai Lapok 14. 425--448. (Joint work with E. Klafszky)
  13. On the Ellipsoid Method (1987--88) Szigma XX No. 2--3. 195--208. (Joint work with E. Klafszky)
  14. On Karmarkar Type Algorithms (1989) Alkalmazott Matematikai Lapok 15. 133--162.
  15. Algorithms for Linear Programming with Polynomial Expected Number of Steps (1990) To appear in Alkalmazott Matematikai Lapok (Joint work with J. C. Fodor and A. Zempléni)
  16. A finite Criss-Cross Method for Hyperbolic Programming (1996) (Joint work with T. Illés and Á. Szirmai). SZIGMA, XXVII No. 1--2. 19--34.

Remark:

  1. Alkalmazott Matematikai Lapok is a Hungarian journal of applied mathematics.
  2. Szigma is a Hungarian journal of econometry.

Thesis

  1. On lp Programming, (1980) Ph.D. Thesis, Faculty of Sciences, L. Eötvös University, Budapest, Hungary.
  2. A Finite Criss--Cross Method and its Applications (1984) Thesis: "Candidate" of Mathematical Sciences (Operations Research) Hungarian Academy of Sciences, Budapest, Hungary.

Publications in Proceedings

  1. On a Mathematical Programming Model of Gasoline Mixing (A Case Study) (1988) (Joint work with G. Wéber) Workshop on Production Management, Janus Pannonius University, Pécs, Hungary. pp. 162--178.
  2. Experiences and Theoretical Investigations on Practical Random Linear Programs (1992) (Joint work with J.C. Fodor, Cs.I. Fábián snd A. Zempléni) Transactions of the Eleventh Prague Conference on Information Theory, Statistical Decision Functions, Random Processes, Prague, Czechoslovakia. pp. 396--408.
  3. A New Algorithm for the Continuous Modular Design Problem (1989) (Joint work with E. Klafszky and J. Mayer) Association of Information Science, Japan. Proceedings of the SIGAL Workshop on Algorithms 10. pp. 1--8.
  4. The Linear Complementarity Problem, Sufficient Matrices and the Criss--Cross Method (1992) (Joint work with D. den Hertog and C. Roos) NATO ASI Series Vol. F82. Combinatorial Optimization, Edited by M. Akgül et al., Springer Verlag Berlin Heidelberg. pp. 253--257.
  5. A General Scheme for Solving Linear Complementarity Problems in the Setting of Oriented Matroids (1993) (Joint work with Z. Wang) In Combinatorics and Graph Theory, eds. H.P. Yap, T.H. Ku, E.K. Lloyd and Z.M. Wang. pp. 244--255. Proceedings of the Spring School and International Conference on Combinatorics: SSIC'92, China, World Scientific, Singapore.
  6. On Vaydia's Volumetric Center Method for Convex Programming (1993) (Joint work with B. Jansen and C. Roos) Symposium on Applied Mathematical Programming and Modeling APMOD93, January 6--8, 1993, Budapest, Hungary. Volume of Extended Abstracts, ed. I. Maros. pp. 289--295.
  7. A Logarithmic Barrier Cutting Plane Method for Convex Programming, (1993) (Joint work with D. den Hertog, J. Kaliski and C. Roos) Symposium on Applied Mathematical Programming and Modeling APMOD93, January 6--8, 1993, Budapest, Hungary. Volume of Extended Abstracts, ed. I. Maros. pp. 266--273.
  8. A Unifying Investigation of Interior Point Methods for Convex Programming (1992) Submitted to Mathematical Programming. (Joint work with D. den Hertog, F. Jarre and C. Roos) Symposium on Applied Mathematical Programming and Modeling APMOD93, January 6--8, 1993, Budapest, Hungary. Volume of Extended Abstracts, ed. I. Maros. pp. 266--273.
  9. Interior Point Approach to the Theory of Linear Programming (1992) (Joint work with O. Güler, C. Roos and J.-Ph. Vial) Proceeding of the Workshop "Interior Point Methods", January 5, 1993, Budapest, Hungary. Report No. 1992--04, Department of Operations Research, Eötvös University Budapest, Hungary.
  10. An Interior Point Approach to Postoptimal and Parametric Analysis in Linear Programming (1992) (Joint work with B. Jansen and C. Roos) Proceeding of the Workshop "Interior Point Methods", January 5, 1993, Budapest, Hungary. Report No. 1992--04, Department of Operations Research, Eötvös University Budapest, Hungary.
  11. Primal--Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method (1992) (Joint work with B. Jansen, C. Roos and J.--Ph. Vial) Proceeding of the Workshop "Interior Point Methods", January 5, 1993, Budapest, Hungary. Report No. 1992--04, Department of Operations Research, Eötvös University Budapest, Hungary.
  12. Maximum Likelihood Estimation of Convex Density (1995) Proceedings of the "International Symposium of Economic Informatics", 10-13 May, Bucharest, Romania, pp. 322-329 (Joint work with J.-Ph. Vial).
  13. Nuclear Reactor Fuel Management Optimization (1997) Proceedings of the conference Optimization in Industry -- 1997 March 22--27, Palm Coast, Florida. 153--158 (Joint work with A.J. Quist, R. van Geemert, J.E. Hoogenboom, T. Illés, E. de Klerk and C. Roos).
  14. An Easy Way to Teach Interior Point Methods (1998) EURO-XVI: Tutorials and Reseach Reviews, pp. 1--28. July 12--15, 1998, Brussels, Belgium.
  15. Robust groundwater management through second-order cone programs (SOCP) (2000) (Joint work with J.M. Ndambuki, C.B.M. Stroet, and E.J.M. Veling)

Publications in Dutch Professional Newspapers

Publications in Dutch

  1. LP-Software overzicht (1995) ITW Nieuws 5. 3. 22--24.
  2. LP-Software survey (1995) ITW Nieuws 5. 3. 22--24. (Joint work with A. Quist)
  3. NLP-Software overzicht (1996) ITW Nieuws 6. 4. 20--23.
  4. NLP-Software survey (1996) ITW Nieuws 6. 4. 20--23. (Joint work with A. Quist)

Reports

  1. A Finite Criss--Cross Method and its Applications (1986) Report No. 179/1986. Computer and Automation Institute of the Hungarian Academy of Sciences, Budapest, Hungary (in Hungarian).
  2. A Model for the Optimal Schedule of MALÉV Flights (1988) (Joint work with M. Biró, Zs. Kemény, I. Simon and L. T´ncos) Case Study. Research Institute of Aviation, Budapest, Hungary (in Hungarian).
  3. Notes on the Edmonds Fukuda Pivoting Rule for Oriented Matroids (1988). (Joint work with J. Clausen.) Preprint, Department of Operations Research, Eötvös University Budapest, Hungary.
  4. Edmonds -- Fukuda Rule and a General Recursion for Quadratic Programming (1989) (Joint work with K. Fukuda) Preprint, Department of Operations Research, Eötvös University Budapest, Hungary.
  5. A Potential Reduction Mhnische Wiskunde en Informatica, Technische Universiteit Delft, The Netherlands.
  6. Iri's Polynomiality Proof for the Iri--Imai Method Recast (1991) (Joint work with D. den Hertog and C. Roos)

    7. Report No. 91--74, Faculteit der Technische Wiskunde en Informatica, Technische Universiteit Delft, The Netherlands.
  7. A New Approach to the Color Matching Problem (1991) (Joint work with T. Illés and J. Mayer)

    8. Report No. 1. 1991. Department of Operations Research, Eötvös University, Budapest, Hungary.
  8. An Interior Point Approach to Postoptimal and Parametric Analysis in Linear Programming (1992) (Joint work with B. Jansen and C. Roos)

    9. Report No. 92--21, Faculteit der Technische Wiskunde en Informatica, Technische Universiteit Delft, The Netherlands.
  9. Interior Point Approach to the Theory of Linear Programming (1992) (Joint work with O. Güler, C. Roos and J.-Ph. Vial) Cahiers de Recherche No. 1992.3, Université de Genève, Département d'Economie Commerciale et Industriell, Genève, Switzerland.
  10. A Unifying Investigation of Interior Point Methods for Convex Programming (1992) (Joint work with D. den Hertog, F. Jarre and C. Roos) Report No. 92--89, Faculteit der Technische Wiskunde en Informatica, Technische Universiteit Delft, The Netherlands.
  11. A Note on Central Cutting Plane Methods for Convex Programming, (1993) (Joint work with D. den Hertog, J. Kaliski and C. Roos)

    12. Report No. 93--44, Faculteit der Technische Wiskunde en Informatica, Technische Universiteit Delft, The Netherlands.
  12. Nonlinear Programming in Computer Aided Color Matching (1993) Submitted to Color Research and Applications. (Joint work with T. Illés, Gy. Lukács, J. Mayer and Á. Tóth)

    13. Preprint, Department of Operations Research, Eötvös University Budapest, Hungary.
  13. A Short Survey on Ten Years Interior Point Methods (1995) (Joint work with B. Jansen and C. Roos).

    14. Report No. 95--45, Faculteit der Technische Wiskunde en Informatica, Technische Universiteit Delft, The Netherlands.
  14. A New Algorithm for the Computation of the Smallest Eigenvalue of a Symmetric Matrix and Its Eigenspace (1995) (Joint work with B. Jansen and C. Roos).

    15. Report No. 95--70, Faculteit der Technische Wiskunde en Informatica, Technische Universiteit Delft, The Netherlands.
  15. A Smoothness Condition for Nonlinear Monotone Complementarity Problems (1995) (Joint work with B. Jansen, C. Roos and A. Yoshise).

    16. The Institute of Statistical Mathematics Cooperative Research Report, Optimization, Japan.
  16. A Branch and Cut Algorithm for the Frequency Assignment Problem (1995) (Joint work with K.I. Aardal, A.L. Hipolito, C.P.M. van Hussel, B. Jansen and C. Roos)

    17. Report 2.2.1 and Technical Annex T-2.2.1 A, EUCLID RTP6.4, Combinatorial Algorithms for Military Applications Delft University of Technology, Department of Technical Mathematics and Informatics, The Netherlands.
  17. Potential Reduction Methods (1995) (Joint work with H. van Benthem, A.L. Hipolito, B. Jansen, C. Roos, and J.P. Warners)

    18. Report 2.3.2, and Technical Annex T-2.3.2 A, EUCLID RTP6.4, Combinatorial Algorithms for Military Applications Delft University of Technology, Department of Technical Mathematics and Informatics, The Netherlands.
  18. GRAPH. A Test Problem Generator for the Radio Link Frequency Assignment Problem (1995) (Joint work with H. van Benthem, A.L. Hipolito, B. Jansen, C. Roos and J.P. Warners)

    19. Report 2.3.2a, and Technical Annex T-2.3.2a A, EUCLID RTP6.4, Combinatorial Algorithms for Military Applications Delft University of Technology, Department of Technical Mathematics and Informatics, The Netherlands.
  19. Semi-definite problems in truss topology optimization. (Joint work with E.deKlerk and C.Roos).

    20. Technical Report 95--128, Faculty of Technical Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands, 1995. 30 pages. Submitted to Engineering Optimization.
  20. Sensitivity analysis in (degenerate) quadratic programming. (Joint work with A.B. Berkelaar, B. Jansen and C.Roos).

    21. Technical Report 96--26, Faculty of Technical Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands, 1996. 16 pages. Submitted to Management Science.
  21. Solving linear systems with low-rank updates. (Joint work with C.Roos, T. Trafalis and J.P. Warners).

    22. Revised version in 1999, new coauthor E.D. Andersen.
    Technical Report 96--149, Faculty of Mathematics and Computer Science, TU Delft, NL--2628BLDelft, The Netherlands, 1996. (Submitted to COAP),8 pages.
  22. Unsupervised neural network training via a potential reduction approach. (Joint work with C.Roos, T. Trafalis and J.P. Warners). (Submitted to JOGO)

    23. Technical Report 96-172, Faculty of Mathematics and Computer Science, TU Delft, NL--2628BLDelft, The Netherlands, 1996.
  23. COLPO: An interactive software system for teaching linear programming modeling. (Joint work with T.Bedford, J.J. de Jong, E. de Klerk, L. Rog, C.Roos and M. van de Veen.

    24. Manuscript 1997, Faculty of Mathematics and Computer Science, TU Delft, NL--2628BLDelft, The Netherlands, 1997.
  24. An easy way to teach interior point methods. Joint work with T. Illés, J. Peng and C.Roos).

    25. Technical Report 98-24, Faculty of Mathematics and Computer Science, TU Delft, NL--2628BLDelft, The Netherlands, 1998. (Submitted to EURO-XVI proceedings)
  25. A simple approach to the interior point theory of P*(k) linear complementarity problems. (Joint work with T. Illés and C.Roos).

    26. Technical Report 99-??, Faculty of Mathematics and Computer Science, TU Delft, NL--2628BLDelft, The Netherlands, 1999. (in preparation)
  26. A new complexity analysis of the primal-dual method for semidefinite optimization based on the NT-direction. (Joint work with J. Peng and C.Roos).

    27. Technical Report 98-46, Faculty of Mathematics and Computer Science, TU Delft, NL--2628BLDelft, The Netherlands, 1999.
  27. A scaled Gauss-Newton Primal--Dual Search Direction for Semidefinite Optimization. (Joint work with E. de Klerk, J. Peng and C.Roos). (Submitted to SIAM Journal on Optimization)

    28. Technical Report 98-50, Faculty of Mathematics and Computer Science, TU Delft, NL--2628BLDelft, The Netherlands, 1999.
  28. Relations Between the Scaled Gauss-Newton Search Direction and the H.K.M. Search Direction for Semidefinite Optimization and their Implementation. (Joint work with J. Peng and C.Roos). (Submitted to SIAM Journal on Scientific Computing)

    29. Technical Report 99-??, Faculty of Mathematics and Computer Science, TU Delft, NL--2628BLDelft, The Netherlands, 1999.
  29. A New Class of Polynomial Primal-Dual Methods for Linear and Semidefinite Optimization. (Joint work with J. Peng and C.Roos). (Submitted to Mathematics of Operations Research)

    30. Technical Report December 1999, Faculty of Mathematics and Computer Science, TU Delft, NL--2628BLDelft, The Netherlands, 1999.
  30. A new approach to optimizing energy systems. (Joint work with P.T. van der Lee and Th. Woudstra). (Submitted to Computer Methods in Applied Mechanics and Engineering)

    31. Technical Report December 1999, Faculty of Mathematics and Computer Science, TU Delft, NL--2628BLDelft, The Netherlands, 1999.
  31. Self-regular Proximities and New Search Directions for Linear and Semidefinite Optimization. (Joint work with J. Peng and C.Roos). (Submitted to Mathematical Programming)

    32. Technical Report March 2000, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada.

Reports in preparation

Large Book Reviews

  1. D. den Hertog: Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity Kluwer Academic Publishers (1993). In Mathematical Reviews, 95d:90001 (1995).
  2. M. Padberg: Linear Optimization and Extensions Springer Verlag (1995). In Mathematical Reviews, 98a:90003 (1998).
  3. S.G. Nash and A. Sofer: Linear and Nonlinaer Programming McGrow Hill (1996). In ITW News, 7. 3. 23 (1997).
  4. G. Dantzig and M. Thapa: Linear Programming I, Springer Verlag (1997). In INFOR, August (1998).
  5. E. Polak: Optimization Algorithms and Consistent Approximations, Springer Verlag (1997). In EJOR, 755--756. 107. (1998).
  6. R. Saigal: Linear Programming: A Modern Integrated Analysis Kluwer Academic Publishers (1993). In Mathematical Reviews, 97h:90003 (1997).
  7. J.K. Lenstra and E. Aarts: Local Search in Combinatorial Optimization John Wiley (1997). In ITW News, 8-3. pp. 30 (1998).
  8. M.A. Goberna and M.A. López: Linear Semi-infinite Optimization John Wiley (1998). To appear in: Structural Optimization (1999).

Computer Aided Teaching

  1. Architect of an interactive teaching program for linear programming (LP--TEACH), quadratic programming (QP--TEACH) and interior point methods (IP--TEACH).
  2. COLPO project, computerized teaching of linear programming modeling.

Talks at Universities and Conferences

Universities

incomplete list

  1. Asia: Tokyo University of Technology (1988, 1989), University of Tsukuba (1988), University of Tsukuba -- Tokyo (1989), University of Tokyo (1989), The Institute of Statistical Mathematics (1989), IBM-Japan (1989), Nanjing University (1998), Nanjing Forestry University (1998), Fudan University Shanghai (1998), Hong Kong University (1998).
  2. North America: Cornell University (1992), RUTGERS University (1992), The University of Iowa (1994), Georgia Institute of Technology (1996), The University of Oklahoma (1996). Georgia Institute of Technology, Atlanta (1996), The University of Florida, Gainswille (1997), Waterloo University (1997), Stanford University (1977), McMaster University, Hamilton (1998, 1999), Princeton University (1999).
  3. Europe: University of Wien (1988), University of Augsburg (1990), University of Köln (1985, 1990), University of Bonn (1985), Technical University Braunschweig (1996), University of Macedonia, Thessaloniki (1996), University of Lisbon (1986), University of Coimbra (1993), University of Oviedo (1993), University of Alicante (1996), Middle East University Cyprus (1996), Fourier University Grenoble (1990), Technical University of Twente (1991), University of Zürich (1992, 1995), Technical University Zürich (1995), Catholic University of Louvain (1993), Erasmus University Rotterdam (1990, 1993), The University of Padova (1994), The University of Geneva (1994), Delft University of Technology (1989, 1990, 1991, 1992, 1993), University of Sofia (1987), University of Belgrade (1988), University of Jena (1987), University of Krakow (1987), University of Trier (1998), Technical University Stockholm (1998), Southampton University (1998).
  4. Hungary: (several times in the eighties) Eötvös University Budapest, University of Economy Budapest, Computer and Automation Institute of the Hungarian Academy of Sciences, Technical University Budapest, National Manager Training Institute Budapest, Technical University Miskolc, Janus Pannonius University Pécs.

Conferences

condensed, incomplete list

  1. EURO and EURO -- TIMS conferences (1986 Lisbon, 1988 Paris, 1982 Helsinki, 1993 Lisbon, Glasgow 1994, Jerusalem 1995, Brussels 1998 (featured speaker));
  2. EURO Summer Institute on Operations Research (1986 Canterbury);
  3. IFIP conferences (1985 Budapest, 1988 Leipzig, 1991 Zürich);
  4. Mathematical Programming Symposium (1988 Tokyo, 1991 Amsterdam, Ann Arbor 1994, Lausanne 1997 (featured speaker);
  5. Franco -- Japan Days on Combinatorics and Optimization (1988, 1989 Tokyo, 1990 Paris, 1991 Grenoble);
  6. NATO -- Advanced Study Institute (1990 Ankara);
  7. SIAM Meeting on Interior Point Methods, (1990 Asylomar, California);
  8. SIAM Conference on Optimization, 1996 Victoria;
  9. ORSA/TIMS (1991 Anaheim, 1992 San Francisco, 1994 Anchorage);

    10. INFORMS (1996 Atlanta, 1997 San Diego, 1998 Montreal and Seattle, );
  10. IFORS conferences (1993 Lisbon, 1996 Vancuver);
  11. SOR conferences (1995 Passau, 1996 Braunschweig);
  12. AMS/SIAM Workshop on Continuous Optimization (1995 Park City, Utah);
  13. Optimization in Industry (1997 Palm Coast, Florida);
  14. ARIDAM-92, RUTCOR, Rutgers University (1992 New Brunswick);
  15. APMOD-93 and Interior Point Methods Workshop (1993 Budapest), APMOD-95 (1995 London), APMOD-98 (1998 Cyprus) (plenary speaker);
  16. Scandinavian Workshop on Linear Programming (1993 Copenhagen);
  17. Conference on Nonlinear Programming and Variational Inequalities, Hong Kong, 1999.
  18. Several talks at smaller workshops and symposia (Paris, Louvain-la-Neuve, Delft, Scheveningen, Rotterdam, Geneva, Tokyo, Hayama, Toronto, Palm Coast, Trier, Stockholm, Coppenhagen, Berlin etc.);
  19. Talks at almost all the Hungarian OR Conferences and International Mathematical Programming Symposia (organized by the Computer and Automation Institute of the Hungarian Academy of Sciences) between 1981 and 1998 (plenary speaker in 1998).

Complete List of Talks Given in 1994

  1. A Family of Polynomial Affine Scaling Algorithms for Linear Complementarity Problems, International Symposium on Mathematical Programming, Mátrafüred, Hungary, January 22--27.
  2. Pivot Rules, Recursions for Linear Programming, University of Padova, Department of Mathematics, Padova, Italy, April 26.
  3. Oriented Matroids: An Abstraction of Linear Programming, University of Padova, Department of Mathematics, Padova, Italy, April 27.
  4. Linear Programming and Linear Complementarity on Oriented Matroids, University of Padova, Department of Mathematics, Padova, Italy, April 28.
  5. On Skew--Symmetric Self--Dual Approach to Linear Programming Problems, University of Padova, Department of Mathematics, Padova, Italy, April 29.
  6. Polynomial Target Following Algorithms for Linear Programming Problems, University of Padova, Department of Mathematics, Padova, Italy, April 29.
  7. On Skew--Symmetric Self--Dual Approach to Linear Programming Problems, University of Geneva, Department of Management Studies, Geneva, Switzerland, May 24--29.
  8. Polynomial Affine Scaling Algorithms for Linear Complementarity Problems, TIMS XXXII, Anchorage, Alaska, USA, June 11--15.
  9. A New and Polynomial--Time Dikin--Type Primal--Dual Interior Point Method for Linear Programming, TIMS XXXII, Anchorage, Alaska, USA, June 11--15.
  10. A Family of Polynomial Affine Scaling Algorithms for Linear Complementarity Problems, EURO XIII/OR36, Glasgow, United Kingdom, July 18--22.
  11. Polynomial Affine Scaling Algorithms for Linear and Monotone Nonlinear Complementarity Problems, 1994 faculty seminar: "Optimization in Theory and Practice", Center of Advanced Studies, The University of Iowa, Iowa City, USA, August 1--12.
  12. A Family of Polynomial Affine Scaling Algorithms for Linear Complementarity Problems, Mathematical Programming Symposium, Ann Arbor, Michigan, USA, August 14--19.
  13. Degeneracy in Interior Point Methods, Mathematical Programming Symposium, Ann Arbor, Michigan, USA, August 14--19.
  14. Pivot Rules for Linear Programming: A Survey on Recent Theoretical Developments, Mathematical Programming Symposium, Ann Arbor, Michigan, USA, August 14--19.
  15. A Unifying View at Interior Point Methods for Linear Programming: the Target--Following Approach, Workshop: Optimization in Engineering Design, Louvain-la-Neuve, Belgium, November 8.
  16. A Logarithmic Barrier Cutting Plane Method for Convex Programming, Workshop: A Non-Linear Symphony, CWI, Amsterdam, The Netherlands, December 16.

Complete List of Talks Given in 1995

  1. Constrained Optimization, Statistical Estimation and Interior Point Methods,

    2. APMOD--95, Brunel University, London, England, April 3--6.
  2. Interior Point Methods: 10 years after Karmarkar, Hungarian Academy of Sciences, Budapest, Hungary, May 10.
  3. Interior Point Methods and its Applications, University of Zürich, Zürich, Switzerland, May 22.
  4. Complementarity Problems and Interior Point Methods, Zürich University of Technology, Zürich, Switzerland, May 23.
  5. A Logarithmic Barrier Cutting Plane Method for Semi--Infinite Programming, PARAOPT-95, Enschede, Twente, June 6--9.
  6. Sensitivity Analysis for LP: Old Traps, New Solutions, EURO XIV conference, Jerusalem, Israel, July 3--7.
  7. An O() Quadratically Convergent Algorithm for the Smallest Eigenvalue Problem, AMS--SIAM Summer Seminar: Mathematics of Numerical Analysis: Real Number Algorithms, Park City, USA, July 24--29.
  8. Target Following: A Unifying View at Interior Point Methods, SOR-95, Passau Germany, September 5--9.
  9. Unifying View of Interior Point Methods, Universiteit Twente, Enschede, September 25.
  10. Optimal Basis Identification and Balinski-Tucker Tableaus in Quadratic programming and Linear Complementarity Problems, CORE, Louvain-la-Neuve, December 19.

Complete List of Talks Given in 1996

  1. Introduction to IPMs for Linear Programming. The University of Alicante, January 26, 1996.
  2. Cutting Plane Methods in Continuous Optimization. The University of Alicante, January 26, 1996.
  3. Basis- and Tripartition Identification for Quadratic Programming and Linear Complementarity Problems: From an interior solution to an optimal basis and vice-versa. Mathematical Programming Symposium, Mátraháza, 23 March, 1996.
  4. An Introduction to Interior Point Methods for LP and Semidefinite Programming. Cyprus, 26 April 1996.
  5. Potential reduction algorithms for structured combinatorial optimization problems. Fields workshop on Semidefinite Optimization, Toronto, 18 May, 1996.
  6. Basis- and Tripartition Identification for Quadratic Programming and Linear Complementarity Problems: From an interior solution to an optimal basis and viceversa. SIAM Conference on Optimization, Victoria, 22 May, 1996.
  7. Target Following Methods: A Unifying View of Interior Point Methods. IFORS, World Conference, Vancuver Canada, July, 1996. National contribution of The Netherlands.
  8. Initialization in semidefinite programming via a self--dual skew--symmetric embedding. SOR-96, Braunschweig, 6 September, 1996.
  9. Basis- and Tripartition Identification for Quadratic Programming and Linear Complementarity Problems: From an interior solution to an optimal basis and vice-versa. SOR-96, Braunschweig, 6 September, 1996.
  10. Initialization in semidefinite programming via embedding. Symposium on Optimization and Computation, Hayama, Japan, 14 August, 1996.
  11. Initialization in semidefinite programming via embedding. High Performance Optimization, Delft, 19 September, 1996.
  12. Basis- and Tripartition Identification for Quadratic Programming and Linear Complementarity Problems: From an interior solution to an optimal basis and vice-versa. INFORMS annual meeting Atlanta, 5 November, 1996.
  13. Potential reduction algorithms for structured combinatorial optimization problems. INFORMS annual meeting Atlanta, 5 November, 1996.
  14. Introduction to Interior Point Methods: Target following and self-dual embedding The University of Oklahoma, Normann, November 10, 1996

Complete List of Talks Given in 1997

  1. A Simple IPM for Linear Programming Yielding an Exact Solution. Waterloo University, Waterloo, March 20, 1997.
  2. Interior Point Methods: New Tools, New Perspectives. Optimization in Industry, Palm Coast, Florida, March 24, 1997.
  3. An Easy Way to Teach Interior Point Methods. The University of Florida, Gainswille, March 28, 1997.
  4. A Logarithmic-Barrier Cutting Plane Method for Semi-Infinite Programming. INFORMS spring meeting San Diego, 6 May, 1997.
  5. Unsupervised neural network training via a potential reduction approach. INFORMS spring meeting San Diego, 6 May, 1997.
  6. An Easy Way to Teach Interior Point Methods. Stanford University, Stanford, May 8, 1997.
  7. A Course on Interior Point Methods for Linear Programming. Two talks of a one day course. High Performance Optimization--II, Rotterdam, 21 August, 1997.
  8. The Criss-cross Method: A Fresh View on Pivot Algorithms. International Symposium on Mathematical Programming, August 24--29, 1997, Lausanne Switzerland. semiplenary talk, featured speaker.
  9. Initialization in Semidefinite Optimization by Self--dual Embedding, Central Path, Maximally Complementary Solution. International Symposium on Mathematical Programming, August 24--29, 1997, Lausanne Switzerland.
  10. Resolving Duality Issues in Semidefinite Optimization by Using Self--dual Embeddin}. Conference of the Hungarian Operations Research Society, October 20--22, 1997, Pécs, Hungary.
  11. The Role of the Analytic Center in Linear and Nonlinear Optimization -- in memoriam György Sonnevend. Conference of the Hungarian Operations Research Society, October 20--22, 1997, Pécs, Hungary. Plenary talk.

Talks Given by Invitations in 1998

  1. On large update primal-dual interior point methods. Department of Operations Research, Eötvös University, Budapest, 24 February, 1998.
  2. On two sandwich theorems. Department of Operations Research, Eötvös University, Budapest, 24 February, 1998.
  3. IPM for Linear Programming: Duality and Complexity. APMOD-98, Nycosia, Cyprus, 11--13 March, 1998. Plenary talk.
  4. On the existence of short admissible pivot sequences for the feasibility problem. APMOD-98, Nycosia, Cyprus, 11--13 March, 1998.
  5. On finding optimal core reload patterns of nuclear reactors. McMaster University, Canada, 24 April, 1998.
  6. Initialization in semidefinite programming via embedding. INFORMS meeting Montreal, 26--29 April, 1998.
  7. On the existence of short admissible pivot sequences for the feasibility problem and LP. INFORMS meeting Montreal, 26--29 April, 1998.
  8. Rounding to Srictly Complementary Solutions in IPMs for LCP. Stockholm Optimization Days, Stockholm, June 25--26, 1998.
  9. IPM for Linear Programming: Duality and Complexity. Southampton University, Southampton, GB, June 24, 1998.
  10. A strongly polynomial rounding procedure for P*(k) Linear Complementary Problems. IPM-Workshop, The University of Trier, Trier, Germany, July 6--7, 1998.
  11. A strongly polynomial rounding procedure for P*(k) Linear Complementary Problems. EURO-XVI, Brussels, July 12--15, 1998.
  12. Initialization in Semidefinite Optimization by Self--dual Embedding. EURO-XVI, Brussels, July 12--15, 1998.
  13. An easy way to teach interior point methods. EURO-XVI, Brussels, July 12--15, 1998. Semiplenary talk, featured speaker.
  14. Rounding to Srictly Complementary Solutions in IPMs for LCP. INFORMS meeting Seattle, 25--28 October, 1998.
  15. On the existence of short admissible pivot sequences for LP and LCP. INFORMS meeting Seattle, 25--28 October, 1998.
  16. Do we need second-order cone proamming? (Thoughts on duality and reformulations). Conference on Semidefinite Optimization, ZIB Berlin, 15--17 November, 1998.
  17. On large update primal-dual interior point methods. Nonlinear Programming and Variational Inequalities, Hong-Kong, 16-19 December, 1998.
  18. On optimizing reloading patterns of nuclear reactors. Nonlinear Programming and Variational Inequalities, Hong-Kong, 16-19 December, 1998.
  19. On identifying a maximally complementary solution for P*(k) LCPs in polynomial time, Hong-Kong, 15-18 December, 1998.
  20. On the existence of short admissible pivot sequences for LP. South-East University, Nanjing, China, 19 December, 1998.
  21. An easy way to teach interior point methods. Nanjing University, Nanjing, China, 21 December, 1998.
  22. Short admissible pivot sequences do exists for LP, but not for OM-LP. Fudan University, Shanghai, China, 22 December, 1998.

Talks and Invitations in 1999

  1. A New Analysis of Search Directions for Semidefinite Optimization DIAMCS workshop on Semidefinite Programming and its Applications to Large Scale Discrete Optimization, Princeton University, 7--9 January, 1999.
  2. On optimizing reloading patterns of nuclear reactors. McMaster University, Canada, 2 March, 1999.
  3. New Complexity Analysis of Primal-Dual Newtons Method for P*(k) Linear Complementarity Problems. International Mathematical Programming Symposium, Mátraháza, Hungary, 27--31 March, 1999.
  4. On convex reformulations of second-order cone programming problems. SIAM Confrence of Optimization, May 10-12, Atlanta, Georgia.
  5. Cone Linear Optimization in Engineering. Optimization in Industry, Banff, Alberta, Canada, June 6--11.
  6. Rounding to Srictly Complementary Solutions in IPMs for LCP. IFORS World Conference, Beijing, China, 16--20 August 1999.
  7. Rounding to Srictly Complementary Solutions in IPMs for LCP. 4th Scandinavian workshop on linear programming, Lyngby, Denmark, 26--28 August 1999.
  8. Rounding to Srictly Complementary Solutions in IPMs for LCP. Semi-infinite programming, Alicante, Spain, 20-23 September 1999.
  9. A Survey on Interior Point Methods for Semidefinite Optimization. RAMP (Research Association of Mathematical Programming) symposium, Fukuoka, Japan, October 18-19, 1999.
  10. Rounding to Srictly Complementary Solutions in IPMs for LCP. The Third World Congress of Nonlinear Analysis, Catania, Italy, July 19-26, 2000.