On infeasibility of systems of convex analytic inequalities
type: Item
instance of: scholarly article
title: On infeasibility of systems of convex analytic inequalities
zbMATH Open document ID: 1016.90033
author: W. T. Obuchowska
published in: Journal of Mathematical Analysis and Applications
publication date: 1999-10-05T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 1309056
zbMATH Keywords: killing constraints
zbMATH Keywords: convex programming
zbMATH Keywords: convex analytic inequality constraints
zbMATH Keywords: irreducible infeasible sets
zbMATH Keywords: perturbation
MaRDI profile type: Publication
OpenAlex ID: W1982333332
cites work: A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
cites work: Quadratically constrained convex quadratic programmes: Faculty feasible regions
cites work: Some results concerning post-infeasibility analysis
cites work: Locating Minimal Infeasible Constraint Sets in Linear Programs
cites work: Analyzing infeasible nonlinear programs
cites work: Q4395423
cites work: Q4079613
cites work: A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
cites work: Q5588268
cites work: Some characterizations and properties of the ``distance to the ill-posedness'' and the condition measure of a conic linear system
cites work: A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
cites work: Q3141900
cites work: Numerical decomposition of a convex function
cites work: Q5589748
cites work: An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
cites work: Q4324980
cites work: Minimal representation of quadratically constrained convex feasible regions
cites work: Minimal representation of convex regions defined by analytic functions
cites work: Infeasibility analysis for systems of quadratic convex inequalities
cites work: Some perturbation theory for linear programming
cites work: Q3853400
cites work: Q5666398
cites work: Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
cites work: Method of reduction in convex programming
DOI: 10.1006/JMAA.1999.6357
description: scientific article; zbMATH DE number 1309056