Mathematical Developments Arising from Linear Programming.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Lagarias, Jeffrey C.
Otros Autores: Todd, Michael J.
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Providence : American Mathematical Society, 1991.
Colección:Contemporary Mathematics.
Temas:
Programming (Mathematics) > Congresses.
Linear programming > Congresses.
Programmation (Mathématiques) > Congrès.
Programmation linéaire > Congrès.
Linear programming
Programming (Mathematics)
Conference papers and proceedings
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Contents
  • 1. Recent Progress and New Directions
  • Some Recent Results on Convex Polytopes
  • Probabilistic Analysis of the Simplex Method
  • On Solving the Linear Programming Problem Approximately
  • Riemannian Geometry Underlying Interior-Point Methods for Linear Programming
  • Steepest Descent, Linear Programming, and Hamiltonian Flows
  • 2. Interior-Point Methods for Linear Programming
  • An O(n3 L) Potential Reduction Algorithm for Linear Programming
  • I. I. Dikin's Convergence Result for the Affine-Scaling Algorithm
  • Phase I Search Directions for a Primal-Dual Interior Point Method for Linear ProgrammingSome Results Concerning Convergence of the Affine Scaling Algorithm
  • Dual Ellipsoids and Degeneracy in the Projective Algorithm for Linear Programming
  • A Note on Limiting Behavior of the Projective and the Affine Rescaling Algorithms
  • 3. Trajectories of Interior-Point Methods
  • On the Convergence Behavior of Trajectories for Linear Programming
  • Limiting Behavior of the Affine Scaling Continuous Trajectories for Linear Programming Problems
  • Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming4. Nonlinear Optimization
  • On the Complexity of a Numerical Algorithm for Solving Generalized Convex Quadratic Programs by Following a Central Path
  • Canonical Problems for Quadratic Programming and Projective Methods for Their Solution
  • An Interior Point Algorithm for Solving Smooth Convex Programs Based on Newton's Method
  • A Modified Kantorovich Inequality for the Convergence of Newton's Method
  • 5. Integer Programming and Multi-Objective Programming
  • ""An Interior-Point Approach to NP-comp1ete Problemsâ€?Part I""""Solving Matching Problems Using Karmarkar's Algorithm""; ""Efficient Faces of Polytopes: Interior Point Algorithms, Parameterizationof Algebraic Varieties, and Multiple Objective Optimization""

Ejemplares similares