Advances in Optimization and Approximation

1994. Auflage 1994
ISBN: 978-0-7923-2785-1
Verlag: Springer Nature Singapore

Buch, Englisch, Band 1, 390 Seiten, Format (B × H): 156 mm x 234 mm, Gewicht: 1650 g

Reihe: Nonconvex Optimization and Its Applications

of SAT Algorithms. 7:3 3. Preliminaries. IV 4. Complete Algorithms and Incomplete Algorithms. 81 5. Optimization: An Iterative Refinement Process. 86 6. Local Search Algorithms for SAT. 89 7. Global Optimization Algorithms for SAT Problem. 106 8. Applications. 137 9. Future Work. 140 10. Conclusions. 141 References. 143 Ergodic Convergence in Proximal Point Algorithms with Bregman Functions. 155 Osman Guier 1. Introduction.:. 155 2. Convergence for Function Minimization. 158 3. Convergence for Arbitrary Maximal Monotone Operators. 161 References. 163 Adding and Deleting Constraints in the Logarithmic Barrier Method for LP. 166 D. den Hertog, C. Roos, and T. Terlaky 1. Introduction. 16(5 2. The Logarithmic Darrier Method. lG8 CONTENTS IX 3. The Effects of Shifting, Adding and Deleting Constraints. 171 4. The Build-Up and Down Algorithm. 177. 5. Complexity Analysis. 180 References. 184 A Projection Method for Solving Infinite Systems of Linear Inequalities. 186 Hui Hu 1. Introduction. 186 2. The Projection Method. 186 3. Convergence Rate. 189 4. Infinite Systems of Convex Inequalities. 191 5. Application. 193 References.

Zielgruppe

Research

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Wirtschaftswissenschaften Betriebswirtschaft Wirtschaftsmathematik und -statistik
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
• Wirtschaftswissenschaften Volkswirtschaftslehre Volkswirtschaftslehre Allgemein Ökonometrie
• Mathematik | Informatik Mathematik Operations Research Spieltheorie
• Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Computeranwendungen in der Mathematik

Inhaltsverzeichnis

Preface. Scheduling Multiprocessor Flow Shops; Bo Chen. The k-Walk Polyhedron; C.R. Coullard, A.B. Gamble, Jin Liu. Two Geometric Optimization Problems; B. Dasgupta, V. Roychowdhury. A Scaled Gradient Projection Algorithm for Linear Complementarity Problems; Jiu Ding. A Simple Proof for a Result of Ollerenshaw on Steiner Trees; Xiufeng Du, Ding-Zhu Du, Biao Gao, Lixue Qü. Optimization Algorithms for the Satisfiability (SAT) Problem; Jun Gu. Ergodic Convergence in Proximal Point Algorithms with Bregman Functions; O. Güler. Adding and Deleting Constraints in the Logarithmic Barrier Method for LP; D. den Hertog, C. Roos, T. Terlaky. A Projection Method for Solving Infinite Systems of Linear Inequalities; Hui Hu. Optimization Problems in Molecular Biology; Tao Jiang, Ming Li. A Dual Affine Scaling Based Algorithm for Solving Linear Semi-Infinite Programming Problems; Chih-Jen Lin, Shu-Cherng Fang, Soon-Yi Wu. A Genuine Quadratically Convergent Polynomial Interior Point Algorithm for Linear Programming; Zhi-Quan Luo, Yinyu Ye. A Modified Barrier Function Method for Linear Programming; M.R. Osborne. A New Facet Class and a Polyhedral Method for the Three-Index Assignment Problem; Liqun Qi, E. Balas, G. Gwan. A Finite Simplex-Active-Set Method for Monotropic Piecewise Quadratic Programming; R.T. Rockafellar, Jie Sun. A New Approach in the Optimization of Exponential Queues; S.H. Xu. The Euclidean Facilities Location Problem; Guoliang Xue, Changyu Wang. Optimal Design of Large-Scale Opencut Coal Mine System; Dezhuang Yang. On the Strictly Complementary Slackness Relation in Linear Programming; Shuzhong Zhang. Analytical Properties of the Central Trajectory in Interior Point Methods; Gongyun Zhao,Jishan Zhu. TheApproximation of Fixed Points of Robust Mappings; Quan Zheng, Deming Zhuang.