On infeasibility of systems of convex analytic inequalities

DOI10.1006/JMAA.1999.6357zbMATH Open1016.90033OpenAlexW1982333332MaRDI QIDQ1295897FDOQ1295897

W. 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

Recommendations

• Infeasibility analysis for systems of quadratic convex inequalities
• Irreducible infeasible sets in convex mixed-integer programs
• Feasibility in reverse convex mixed-integer programming
• Minimal infeasible constraint sets in convex integer programs
• Identifying Minimally Infeasible Subsystems of Inequalities

zbMATH Keywords

convex programmingperturbationirreducible infeasible setsconvex analytic inequality constraintskilling constraints

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Some results concerning post-infeasibility analysis
• Some perturbation theory for linear programming
• Title not available (Why is that?)
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
• A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
• Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
• Title not available (Why is that?)
• Infeasibility analysis for systems of quadratic convex inequalities
• Analyzing infeasible nonlinear programs
• Title not available (Why is that?)
• 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
• Numerical decomposition of a convex function
• Title not available (Why is that?)
• Method of reduction in convex programming
• Quadratically constrained convex quadratic programmes: Faculty feasible regions
• Minimal representation of quadratically constrained convex feasible regions
• Minimal representation of convex regions defined by analytic functions

Cited In (9)

• Title not available (Why is that?)
• Automatic repair of convex optimization problems
• Feasibility in reverse convex mixed-integer programming
• Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
• On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
• Irreducible infeasible sets in convex mixed-integer programs
• Feasible partition problem in reverse convex and convex mixed-integer programming
• Minimal infeasible constraint sets in convex integer programs
• Title not available (Why is that?)

This page was built for publication: On infeasibility of systems of convex analytic inequalities

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