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