Representing the space of linear programs as the Grassmann manifold

DOI10.1007/S10107-008-0237-6MaRDI QIDQ847840zbMATH OpenOpenAlexFDO

Authors Gongyun Zhao

Publication date 19 February 2010

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-008-0237-6

zbMATH Keywords

basis partitionoptimal basisprojection matrix

Mathematics Subject Classification ID

Grassmannians, Schubert varieties, flag manifolds (14M15) Linear programming (90C05)

Review text

The authors develop a theoretical foundation and study basic properties of equilibrium points, stable points and attraction regions of dynamical systems. This paper intends to introduce a representation of the space of LP and to study the structure of the space. A number of theorems and lemmas are proposed but no numerical experiments are presented.

Recommendations

• A simple polynomial-time rescaling algorithm for solving linear programs
• Numerical representations of a universal subspace flow for linear programs
• Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
• scientific article; zbMATH DE number 5984167
• On stability of mixed equilibria

Cites work

• scientific article; zbMATH DE number 2129143 (Why is no real title available?)
• scientific article; zbMATH DE number 3521121 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• Limiting behavior of weighted central paths in linear programming
• On the complexity of following the central path of linear programs by linear extrapolation. II
• Optimization and dynamical systems

Cited in

(5)

• A natural notion of morphism for linear programming problems
• An analogue of the Klee-Walkup result for sonnevend's curvature of the central path
• Inexact restoration method for minimization problems arising in electronic structure calculations
• Degree of the Grassmannian as an affine variety
• Grassmannian optimization is NP-hard

This page was built for publication: Representing the space of linear programs as the Grassmann manifold

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847840)