Pages that link to "Item:Q2532626"
From MaRDI portal
The following pages link to Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory (Q2532626):
Displaying 50 items.
- \(B_D\)-splittings of matrices (Q432735) (← links)
- Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
- Feasibility and solvability of Lyapunov-type linear programming over symmetric cones (Q707872) (← links)
- On the unidentifiability of the fixed-effects 3PL model (Q748213) (← links)
- Saddle-point theorems for rational approximation (Q788932) (← links)
- A geometric Gordan-Stiemke theorem (Q798735) (← links)
- The primal-dual algorithm as a constraint-set-manipulation device (Q811396) (← links)
- Necessary and sufficient conditions for solving infinite-dimensional linear inequalities (Q850601) (← links)
- An iterative row-action method for interval convex programming (Q1138236) (← links)
- Some applications of optimization in matrix theory (Q1158352) (← links)
- Geometric conditions for the existence of positive eigenvalues of matrices (Q1159251) (← links)
- On nonlinear programming in complex spaces (Q1193168) (← links)
- Nonlinear complex programming (Q1211419) (← links)
- Polyhedral cones and positive operators (Q1214976) (← links)
- Computational methods for generalized inverse matrices arising from proper splittings (Q1229277) (← links)
- On ranges of real Lyapunov transformations (Q1229936) (← links)
- Pareto optimality in multiobjective problems (Q1233815) (← links)
- Control with conic control constraint set (Q1236504) (← links)
- Degenerate quadratic programming and \(\ell_p\) approximation problems (Q1244172) (← links)
- Generalized inverse-positivity and splittings of M-matrices (Q1257942) (← links)
- Singular M-matrices and inverse positivity (Q1259642) (← links)
- Further generalizations of Farkas' theorem and their applications in optimal control (Q1378682) (← links)
- Constraint qualifications in nonsmooth multiobjective optimization (Q1594878) (← links)
- Constrained best approximation in Hilbert space (Q1824131) (← links)
- Extension to necessary optimality conditions in complex programming (Q1827369) (← links)
- Duality for complex programming (Q1843374) (← links)
- Bounds for error in the solution set of a perturbed linear program (Q1844586) (← links)
- A duality theorem for a special class of programming problems in complex space (Q1844590) (← links)
- Gaddum's test for symmetric cones (Q2022297) (← links)
- Predicting slow relaxation timescales in open quantum systems (Q2160351) (← links)
- Complex nonlinear programming: Duality with invexity and equivalent real programs (Q2277371) (← links)
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization (Q2370062) (← links)
- On the key theorem of Tucker and Levison for complex linear inequalities (Q2536810) (← links)
- Duality for nonlinear programming in complex space (Q2538057) (← links)
- Asymptotic duality over closed convex sets (Q2539954) (← links)
- An extension of the transposition theorems of Farkas and Eisenberg (Q2543640) (← links)
- Existence theory for the complex linear complementarity problem (Q2545665) (← links)
- More on linear inequalities with applications to matrix theory (Q2547249) (← links)
- Extension of Newton's method to nonlinear functions with values in a cone (Q2549566) (← links)
- A generalization of irreducible monotonicity (Q2555903) (← links)
- Linear equations over cones with interior: a solvability theorem with applications to matrix theory (Q2558349) (← links)
- Nonlinear programming in complex space: Sufficient conditions and duality (Q2562045) (← links)
- Solution of the complex linear complementarity problem (Q2562753) (← links)
- Sufficiency criteria and duality in complex nonlinear programming involving pseudoinvex function (Q3123133) (← links)
- (Q3342228) (← links)
- Perturbed convex programming in reflexive Banach spaces (Q3347642) (← links)
- A simple constraint qualification in infinite dimensional programming (Q3731366) (← links)
- Cones, graphs and optimal scalings of matrices (Q3871026) (← links)
- Complete characterization of optimality for convex programming in banach spaces<sup>†</sup> (Q3890447) (← links)
- On the complex complementarity problem (Q4047404) (← links)
