Generation of interior points and polyhedral representations of cones in \(\mathbb R^N\) cut by \(M\) planes sharing a common point

DOI10.1007/S00186-015-0520-2zbMath1336.52028OpenAlexW1949032623MaRDI QIDQ261538

F. Blanchet-Sadri, M. Dambrine

Publication date: 24 March 2016

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-015-0520-2

zbMATH Keywords

algorithmprojection methodhyperplanes in \(\mathbb R^N\)linear homogeneous systems

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial complexity of geometric structures (52C45)

Uses Software

• Ipopt

Cites Work

• A polynomial projection algorithm for linear feasibility problems
• A new polynomial-time algorithm for linear programming
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generation of interior points and polyhedral representations of cones in \(\mathbb R^N\) cut by \(M\) planes sharing a common point