Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory

DOI10.1016/0022-247X(69)90054-7zbMath0174.31502OpenAlexW2081027419MaRDI QIDQ2532626

Adi Ben-Israel

Publication date: 1969

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

Full work available at URL: https://doi.org/10.1016/0022-247x(69)90054-7

zbMATH Keywords

linear equationslinear inequalitiesconsistent systemasymptotically consistent system

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Vector spaces, linear dependence, rank, lineability (15A03) Linear equations (linear algebraic aspects) (15A06)

Related Items (67)

Necessary optimality conditions in terms of convexificators in Lipschitz optimization ⋮ Necessary and sufficient conditions for solving infinite-dimensional linear inequalities ⋮ Unnamed Item ⋮ A simple constraint qualification in infinite dimensional programming ⋮ Predicting slow relaxation timescales in open quantum systems ⋮ Further generalizations of Farkas' theorem and their applications in optimal control ⋮ Unnamed Item ⋮ An iterative row-action method for interval convex programming ⋮ Lagrangian duality in convex conic programming with simple proofs ⋮ Linear inequalities, mathematical programming and matrix theory ⋮ A Fritz John theorem in complex space ⋮ On the complex complementarity problem ⋮ \(B_D\)-splittings of matrices ⋮ Modified regularity conditions for nonlinear programming problems over mixed cone domains ⋮ Some applications of optimization in matrix theory ⋮ Geometric conditions for the existence of positive eigenvalues of matrices ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Avoiding a Constraint Qualification ⋮ STEIN LINEAR PROGRAMS OVER SYMMETRIC CONES ⋮ Duality for generalized problems in complex programming ⋮ On nonlinear programming in complex spaces ⋮ On ranges of Lyapunov transformations IV ⋮ Quadratic duality over convex cone domains ⋮ Nonlinear complex programming ⋮ Polyhedral cones and positive operators ⋮ Feasibility and solvability of Lyapunov-type linear programming over symmetric cones ⋮ Perturbed convex programming in reflexive Banach spaces ⋮ Computational methods for generalized inverse matrices arising from proper splittings ⋮ On ranges of real Lyapunov transformations ⋮ Gaddum's test for symmetric cones ⋮ Duality in finite dimensional complex space ⋮ Pareto optimality in multiobjective problems ⋮ Complex nonlinear programming: Duality with invexity and equivalent real programs ⋮ Control with conic control constraint set ⋮ Cones, graphs and optimal scalings of matrices ⋮ Degenerate quadratic programming and \(\ell_p\) approximation problems ⋮ Generalized inverse-positivity and splittings of M-matrices ⋮ Complete characterization of optimality for convex programming in banach spaces^† ⋮ Singular M-matrices and inverse positivity ⋮ On the unidentifiability of the fixed-effects 3PL model ⋮ On the key theorem of Tucker and Levison for complex linear inequalities ⋮ Duality for nonlinear programming in complex space ⋮ Asymptotic duality over closed convex sets ⋮ Duality in complex homogeneous programming ⋮ Duality in complex homogeneous programming ⋮ An extension of the transposition theorems of Farkas and Eisenberg ⋮ Existence theory for the complex linear complementarity problem ⋮ More on linear inequalities with applications to matrix theory ⋮ Extension of Newton's method to nonlinear functions with values in a cone ⋮ Constrained best approximation in Hilbert space ⋮ Extension to necessary optimality conditions in complex programming ⋮ A generalization of irreducible monotonicity ⋮ Linear equations over cones with interior: a solvability theorem with applications to matrix theory ⋮ Nonlinear programming in complex space: Sufficient conditions and duality ⋮ Theorems of the Alternative for Cones and Lyapunov Regularity of Matrices ⋮ Solution of the complex linear complementarity problem ⋮ Duality for complex programming ⋮ Saddle-point theorems for rational approximation ⋮ Bounds for error in the solution set of a perturbed linear program ⋮ A duality theorem for a special class of programming problems in complex space ⋮ Sufficiency criteria and duality in complex nonlinear programming involving pseudoinvex function ⋮ A geometric Gordan-Stiemke theorem ⋮ Constraint qualifications in nonsmooth multiobjective optimization ⋮ Applying solvability theorems for matrix equations ⋮ On duality in complex linear programming ⋮ A Fritz John type sufficient optimality theorem in complex space ⋮ The primal-dual algorithm as a constraint-set-manipulation device

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some characterizations of convex polyhedra
• Linear programming in complex space
• Notes on linear inequalities. I: The intersection of the non-negative orthant with complementary orthogonal subspaces
• Quadratic programming in complex space
• Solvability and Consistency for Linear Equations and Inequalities
• Linear Inequalities and Related Systems. (AM-38)
• New Characterizations of Polyhedral Cones
• An Extension of the Nonhomogeneous Farkas Theorem
• Systems of linear inequalities
• On the intersections of cones and subspaces
• Applications of the Hahn-Banach Theorem in Approximation Theory
• Linear Inequalities and Analysis
• Duality and asymptotic solvability over cones
• THE STRONG MINKOWSKI FARKAS-WEYL THEOREM FOR VECTOR SPACES OVER ORDERED FIELDS
• Systems of Linear Relations
• A MATRIX PROOF OF FARKAS'S THEOREM
• An Extension of the Farkas Theorem
• Contributions to the Theory of Generalized Inverses
• A Note on Pseudoinverses

This page was built for publication: Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory