2. The Algorithm ...59 3. Convergence Analysis ..., ...60 4. Complexity Analysis ...63 5. Conclusions ...67 References ...67 A Simple Proof for a Result of Ollerenshaw on Steiner Trees ...68 Xiufeng Du, Ding-Zhu Du, Biao Gao, and Lixue Qii 1. Introduction ...68 2. In the Euclidean Plane ...69 3. In
Advances in Optimization and Approximation
β Scribed by Ding-Zhu Du, Jie Sun (eds.)
- Publisher
- Springer US
- Year
- 1994
- Tongue
- English
- Leaves
- 402
- Series
- Nonconvex Optimization and Its Applications 1
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Table of Contents
Front Matter....Pages i-xiii
Scheduling Multiprocessor Flow Shops....Pages 1-8
The K -Walk Polyhedron....Pages 9-29
Two Geometric Optimization Problems....Pages 30-57
A Scaled Gradient Projection Algorithm for Linear Complementarity Problems....Pages 58-67
A Simple Proof for a Result of Ollerenshaw on Steiner Trees....Pages 68-71
Optimization Algorithms for the Satisfiability (SAT) Problem....Pages 72-154
Ergodic Convergence in Proximal Point Algorithms with Bregman Functions....Pages 155-165
Adding and Deleting Constraints in the Logarithmic Barrier Method for LP....Pages 166-185
A Projection Method for Solving Infinite Systems of Linear Inequalities....Pages 186-194
Optimization Problems in Molecular Biology....Pages 195-216
A Dual Affine Scaling Based Algorithm for Solving Linear Semi-Infinite Programming Problems....Pages 217-234
A Genuine Quadratically Convergent Polynomial Interior Point Algorithm for Linear Programming....Pages 235-246
A Modified Barrier Function Method for Linear Programming....Pages 247-255
A New Facet Class and a Polyhedral Method for the Three-Index Assignment Problem....Pages 256-274
A Finite Simplex-Active-Set Method for Monotropic Piecewise Quadratic Programming....Pages 275-292
A New Approach in the Optimization of Exponential Queues....Pages 293-312
The Euclidean Facilities Location Problem....Pages 313-331
Optimal Design of Large-Scale Opencut Coal Mine System....Pages 332-346
On the Strictly Complementary Slackness Relation in Linear Programming....Pages 347-361
Analytical Properties of the Central Trajectory in Interior Point Methods....Pages 362-375
The Approximation of Fixed Points of Robust Mappings....Pages 376-389
β¦ Subjects
Optimization; Operations Research/Decision Theory; Theory of Computation; Discrete Mathematics in Computer Science
π SIMILAR VOLUMES
2. The Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 3. Convergence Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . , . . . . 60 4. Complexity Analysis .
I rated 3 stars mainly because the book, contrarily to the advertising, isn't for engineers, it is for mathematicians. Is written with a very sophisticated mathematics, where simple things become complicated. If you're an engineer you might not be able to read it, or even if you're are able to, you
<p><p>This book provides a basic, initial resource, introducing science and engineering students to the field of optimization. It covers three main areas: mathematical programming, calculus of variations and optimal control, highlighting the ideas and concepts and offering insights into the importan
<p>This book provides a basic, initial resource, introducing science and engineering students to the field of optimization. It covers three main areas: mathematical programming, calculus of variations and optimal control, highlighting the ideas and concepts and offering insights into the importance