OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS

DOI10.1080/02331930290019459zbMath1022.90015OpenAlexW2086459570MaRDI QIDQ4548047

No author found.

Publication date: 3 November 2003

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930290019459

zbMATH Keywords

consistencyconvex programminginconsistencysemidefinite programshomogeneous programs\(\varepsilon\)-infeasibilitynon-polyhedral convex cones

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Extending the mixed algebraic-analysis Fourier–Motzkin elimination method for classifying linear semi-infinite programmes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear programming related to homogeneous programming
• Some perturbation theory for linear programming
• Classifying convex extremum problems over linear topologies having separation properties
• Linear programming, complexity theory and elementary functional analysis
• Asymptotic cones and duality of linear relations
• Asymptotic duality over closed convex sets
• Programmes in Paired Spaces
• Barrier Functions in Interior Point Methods
• On the Self-Concordance of the Universal Barrier Function
• [https://portal.mardi4nfdi.de/wiki/Publication:5525791 Optimierungsaufgaben in topologischen Vektorr�umen I: Dualit�tstheorie]
• Duality and asymptotic solvability over cones
• Linear Programming in Reflexive Spaces