Cones, matrices and mathematical programming

Publication date: 1973

Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Linear inequalities of matrices (15A39) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Research exposition (monographs, survey articles) pertaining to linear algebra (15-02)

Related Items

Penalized and constrained LAD estimation in fixed and high dimension, Criteria for copositive matrices using simplices and barycentric coordinates, Cross-positive matrices revisited, Solvability results for sublinear functions and operators, Pseudomonotone and copositive star matrices, Universal duality in conic convex optimization, On inequality constrained generalized least squares selections in the general possibly singular Gauss-Markov model: A projector theoretical approach, Optimality conditions for generalized Ky Fan quasi-inequalities with applications, Weak stability for matrices, Some remarks on cone-functions and related fields, Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach, Strong duality and minimal representations for cone optimization, A fresh CP look at mixed-binary QPs: new formulations and relaxations, A new approximation hierarchy for polynomial conic optimization, Interiors of completely positive cones, On the semiring of cone preserving maps, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming, Generalized inverses of cone preserving maps, Theory of cones, A geometric treatment of generalized inverses and semigroups of nonnegative matrices, Some applications of optimization in matrix theory, On weak * closedness, coerciveness, and inf-sup theorems, Geometric conditions for the existence of positive eigenvalues of matrices, On the distinguished eigenvalues of a cone-preserving map, Order intervals of matrices, Some further results on matrix monotonicity, A finite steps algorithm for solving convex feasibility problems, On the structure of the cone of positive operators, On spectral maps induced by convex cones, Block diagonal semistability factors and Lyapunov semistability of block triangular matrices, A note on alternating projections for ill-posed semidefinite feasibility problems, The geometry of the set of scaled projections, The cone of nonnegative \(c\)-numerical range and its preservers, Extreme Points in Convex Sets of Symmetric Matrices, Unnamed Item, Self-dual cones in Euclidean spaces, Generalizations of matrix monotonicity, Eight types of matrix monotonicity, On the uniqueness of the Lyapunov scaling factors, An operational test for the existence of a consistent increasing quasi-concave value function, Positive diagonal solutions to the Lyapunov equations, Classes of stable and semipositive matrices, Considering copositivity locally, Some topics in vector optimization via image space analysis, Faces and duality in convex cones, Linear programming and operator means, A study of projectionally exposed cones, On the cone of positive semidefinite matrices, Extension to necessary optimality conditions in complex programming, On convex generalized systems, Theorems of the Alternative for Cones and Lyapunov Regularity of Matrices, More on generalizations of matrix monotonicity, On copositive matrices, Images of cones under linear mappings, Tridiagonal and upper triangular inverse M-matrices, On the recognition of \(S\)-systems, On the duality operator of a convex cone