Infeasibility analysis for systems of quadratic convex inequalities
From MaRDI portal
Publication:1296129
Recommendations
Cites work
- A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
- Analyzing infeasible nonlinear programs
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 1163815 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Minimal representation of quadratically constrained convex feasible regions
- Quadratically constrained convex quadratic programmes: Faculty feasible regions
- Some perturbation theory for linear programming
- Some results concerning post-infeasibility analysis
Cited in
(7)- On infeasibility of systems of convex analytic inequalities
- 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
- Feasibility in reverse convex mixed-integer programming
- Irreducible infeasible sets in convex mixed-integer programs
- A structural geometrical analysis of weakly infeasible SDPS
This page was built for publication: Infeasibility analysis for systems of quadratic convex inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296129)