A truncated log Barrier algorithm for large scale convex programming and minmax problems:implementation and computational resultsFootnote^∗

^∗Research supported by the Isreal-USA Binational Science Foundation(BSF).

References

• Achtziger , W. , Bends⊘e , M.P. , Ben-Tal , A. and Zowe , J. 1992 . Equivalent displacement based formulation for maximum strength truss topology design . Impact of Computing in Science and Engineering , 4 : 315 – 345 .
   Google Scholar
• Bathe , K.J. and Wilson , E.L. 1976 . Numerical Methods in Finite Element Analysis , Englewood Cliffs : Prentice Hall .
   Google Scholar
• Ben-Tal , A. and Bends⊘e , M.P. 1993 . A new method for optimal truss topology design . SIAM Journal of Optimization , 3 : 322 – 358 .
   Web of Science ®Google Scholar
• Ben-Tal A. Bend⊘se M.P. Interior point polynomial time method for truss topology design Optimization Laboratory, Faculty of Industrial Engineering and Management,Technion-Israel Institute of Technology Haifa 1992 Research Report, 3/92,To appear in SIAM Optimization
   Google Scholar
• Ben-Tal A. Zibulevski M. Penalty/Barrier multiplier methods:A new class of augmented Lagrangian algorithms for large-scale convex programming problems Optimization Laboratory, Faculty of Industrial Engineering and Management,Technion-Israel Institute of Technology Haifa 1993 Research Report, 4/93,To appear in SIAM Optimization
   Google Scholar
• Bends⊘e , M.P. , Ben-Tal , A. and Zowe , J. 1994 . Optimization methods for truss geometry and topology design . Structural Optimization , 7 : 141 – 159 .
   Google Scholar
• Bends⊘e , M.P. 1995 . Methods for the Optimization of Structural Topology,Shape and Material , New York, NY : Springer-Verlag .
   Google Scholar
• Bends⊘e , M.P. , Guedes , J.M. , Haber , R.B. , Redersen , P. and Taylor , J.E. 1994 . An analytical model to predict optimal material properties in the context of optimal structural design . Transaction of the ASME , 61 : 930 – 937 .
   Google Scholar
• Breitfeld , M.G. and Shanno , D.F. 1993 . Computational experience with modified log-Barrier methods for nonlinear programming , New Jersey : Rutgers University . Rutcor Research Report
   Google Scholar
• Ben-Israel , A. , Ben-Tal , A. and Zlobec , S. 1981 . Optimality in Nonlinear Programming:A Feasible Directions Approach , New York, NY : Wiley .
   Google Scholar
• Den-Hertog , D. 1992 . “ Interior point approach to linear, quadratic and convex programming ” . In Ph.D.thesis , Technische Universiteit Delft .
   Google Scholar
• Fiacco , A.V. and McCormick , G.P. 1968 . Nonlinear Programming:Sequential Unconstrained Minimization Techniques , New York, NY : Wiley .
   Google Scholar
• Gal , S. , Bachelis , B. and Ben-Tal , A. 1978 . On finding the maximal range of validity of a constrained system . SIAM J. Control and Optimization , 16 : 473 – 503 .
   Google Scholar
• Goldfarb , D. , Liu , S. and Wang , S. 1991 . A logarithmic Barrier algorithm for quadratically constrained convex quadratic programming . SIAM J.on Optimization , 1 : 252 – 267 .
   Google Scholar
• Jarre , F. 1989 . “ On the method of analytic centers for solving smooth convex programs ” . In Lecture Notes in Mathematics , Edited by: Dolkey , S. Vol. 1405 , 69 – 85 . Springer .
   Google Scholar
• Jarre , F. 1991 . On the convergence of the method of analytic centers when applied to convex quadratic programs . Mathematical Programming , 49 : 341 – 358 .
   Google Scholar
• Jarre , F. 1992 . An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices . SIAM J.Control and Optimization , 49
   Google Scholar
• Mehrotra , S. and Sun , S. 1991 . A method of analytic centers for quadratically constrained convex quadratic program . SIAM J.on Numerical Analysis , 28 : 529 – 544 .
   Google Scholar
• Nesterov , Y. and Nemirovskii , A. 1993 . Interior-Point Polynomial Algorithms in Convex Programming:Theory and Applications , Philadelphia, PA : SIAM Publications .
   Google Scholar
• Polyak , R. 1992 . Modified Barrier functions (theory and methods) . Mathematical Programming , 54 : 177 – 222 .
   Web of Science ®Google Scholar
• Roth , G. 1992 . “ An “interior point type” algorithm for solving large scale nonlinear optimization problems ” . In Ph.D.proposal , Haifa, , Israel : Israel Institute of Technology . Technion
   Google Scholar
• Vial , J. 1994 . Computational experience with a primal-dual interior-point method for smooth convex programming . Optimization Methods and Software , to appear
   Google Scholar