The following pages link to Adi Ben-Israel (Q168840):
Displaying 50 items.
- A suboptimization method for interval linear programming: A new method for linear programming (Q2545859) (← links)
- More on linear inequalities with applications to matrix theory (Q2547249) (← links)
- The geometry of solvability and duality in linear programming (Q2547519) (← links)
- On the solution of maximization problems of optimal design by geometric programming (Q2548081) (← links)
- Erratum: Asymptotic duality over closed convex sets (Q2550671) (← links)
- Linear equations over cones with interior: a solvability theorem with applications to matrix theory (Q2558349) (← links)
- Extremal solutions of linear equations and generalized inversion between Hilbert spaces (Q2562496) (← links)
- Directional Newton methods in \(n\) variables (Q2759095) (← links)
- Directional Halley and quasi-Halley methods in \(n\) variables (Q2768026) (← links)
- On modeling risk in Markov decision processes. (Q2776665) (← links)
- The Newton Bracketing Method for Convex Minimization: Convergence Analysis (Q2897275) (← links)
- An inverse Newton transform (Q2906479) (← links)
- (Q2943972) (← links)
- (Q3037158) (← links)
- The Newton and Halley Methods for Complex Roots (Q3146508) (← links)
- (Q3272208) (← links)
- (Q3272209) (← links)
- (Q3320134) (← links)
- PROBABILISTIC DISTANCE CLUSTERING ADJUSTED FOR CLUSTER SIZE (Q3541004) (← links)
- (Q3668735) (← links)
- Specifying the systematic risk of portfolios : a closed form solution (Q3690615) (← links)
- What is invexity? (Q3741450) (← links)
- Duality in convex programming: a linearization approach<sup>1</sup> (Q3863439) (← links)
- (Q3867916) (← links)
- (Q3888049) (← links)
- (Q3892082) (← links)
- (Q3897149) (← links)
- (Q3902815) (← links)
- (Q3913531) (← links)
- (Q3957539) (← links)
- A bisection/successive approximation method for computing Gittins indices (Q3970270) (← links)
- On generalized matrix functions (Q4041692) (← links)
- (Q4047674) (← links)
- (Q4061081) (← links)
- Technical Note—Optimality Conditions and Recession Cones (Q4085498) (← links)
- (Q4100712) (← links)
- (Q4113949) (← links)
- Primal Geometric Programs Treated by Linear Programming (Q4116269) (← links)
- On A characterization of optimality in convex programming (Q4123086) (← links)
- (Q4125658) (← links)
- Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming (Q4145431) (← links)
- (Q4191877) (← links)
- Characterizations of optimality in convex programming: the nondifferentiable case (Q4196253) (← links)
- Complementary halfspaces and trigonometric Ceva-Brocard inequalities for polygons (Q4248985) (← links)
- (Q4273941) (← links)
- (Q4336950) (← links)
- The Change-of-Variables Formula Using Matrix Volume (Q4702265) (← links)
- The Moore of the Moore-Penrose inverse (Q4706980) (← links)
- Generalized inverses of matrices: a perspective of the work of Penrose (Q4724766) (← links)
- Support prices of activities in linear programming<sup>1</sup>,<sup>2</sup> (Q4733662) (← links)