OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS

DOI10.1080/02331930290019459MaRDI QIDQ4548047zbMATH OpenOpenAlexFDO

Authors

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 programmingsemidefinite programsinconsistencyhomogeneous 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)

Recommendations

• Advances in convex optimization: conic programming
• Some results of convex programming complexity
• Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
• Universal duality in conic convex optimization
• Detecting infeasibility in infeasible-interior-point methods for optimization

Cites work

• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 1502618 (Why is no real title available?)
• scientific article; zbMATH DE number 3443412 (Why is no real title available?)
• Asymptotic cones and duality of linear relations
• Asymptotic duality over closed convex sets
• Barrier Functions in Interior Point Methods
• Classifying convex extremum problems over linear topologies having separation properties
• Duality and asymptotic solvability over cones
• Linear Programming in Reflexive Spaces
• Linear programming related to homogeneous programming
• Linear programming, complexity theory and elementary functional analysis
• On the Self-Concordance of the Universal Barrier Function
• Optimierungsaufgaben in topologischen Vektorr�umen I: Dualit�tstheorie
• Programmes in Paired Spaces
• Some perturbation theory for linear programming

Cited in

(3)

• Extending the mixed algebraic-analysis Fourier-Motzkin elimination method for classifying linear semi-infinite programmes
• New stopping criteria for detecting infeasibility in conic optimization
• A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs

This page was built for publication: OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS

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