On infeasibility of systems of convex analytic inequalities

DOI10.1006/jmaa.1999.6357zbMath1016.90033OpenAlexW1982333332MaRDI QIDQ1295897

Wiesława T. Obuchowska

Publication date: 5 October 1999

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/fafb87e80ab35efddaf7a555674ea01a3a8eb1b0

zbMATH Keywords

perturbationconvex programmingirreducible infeasible setsconvex analytic inequality constraintskilling constraints

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Related Items

Feasibility in reverse convex mixed-integer programming, Irreducible infeasible sets in convex mixed-integer programs, Automatic repair of convex optimization problems, Feasible partition problem in reverse convex and convex mixed-integer programming, Minimal infeasible constraint sets in convex integer programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numerical decomposition of a convex function
• A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
• Method of reduction in convex programming
• Quadratically constrained convex quadratic programmes: Faculty feasible regions
• Infeasibility analysis for systems of quadratic convex inequalities
• Some results concerning post-infeasibility analysis
• Some perturbation theory for linear programming
• Minimal representation of convex regions defined by analytic functions
• Minimal representation of quadratically constrained convex feasible regions
• Analyzing infeasible nonlinear programs
• Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
• Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
• A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
• Locating Minimal Infeasible Constraint Sets in Linear Programs