![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Adi Ben-Israel
Person information
- affiliation: Rutgers University, Piscataway, NJ, USA
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j27]Christopher Gaffney, Adi Ben-Israel:
A simple insurance model: optimal coverage and deductible. Ann. Oper. Res. 237(1-2): 263-279 (2016) - 2015
- [i1]Tsvetan Asamov, Adi Ben-Israel:
An ℓ1-Method for Clustering High-Dimensional Data. CoRR abs/1504.01294 (2015) - 2013
- [j26]Adi Ben-Israel:
A concentrated Cauchy distribution with finite moments. Ann. Oper. Res. 208(1): 147-153 (2013) - 2011
- [p1]Adi Ben-Israel, Yuri Levin:
The Newton Bracketing Method for Convex Minimization: Convergence Analysis. Fixed-Point Algorithms for Inverse Problems in Science and Engineering 2011: 49-64 - 2010
- [j25]Cem Iyigun, Adi Ben-Israel:
A generalized Weiszfeld method for the multi-facility location problem. Oper. Res. Lett. 38(3): 207-214 (2010)
2000 – 2009
- 2008
- [j24]Adi Ben-Israel, Cem Iyigun:
Probabilistic D-Clustering. J. Classif. 25(1): 5-26 (2008) - [j23]Adi Ben-Israel, Yuri Levin:
The Newton Bracketing method for the minimization of convex functions subject to affine constraints. Discret. Appl. Math. 156(11): 1977-1987 (2008) - [j22]Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris Rozin:
Approximate methods for convex minimization problems with series-parallel structure. Eur. J. Oper. Res. 189(3): 841-855 (2008) - [c1]Cem Iyigun, Adi Ben-Israel:
Semi-supervised Probabilistic Distance Clustering and the Uncertainty of Classification. GfKl 2008: 3-20 - 2004
- [j21]Yuri Levin, Adi Ben-Israel:
A heuristic method for large-scale multi-facility location problems. Comput. Oper. Res. 31(2): 257-272 (2004) - 2002
- [b2]Adi Ben-Israel, Robert Gilbert:
Computer-Supported Calculus. Texts & Monographs in Symbolic Computation, Springer 2002, ISBN 978-3-7091-7230-8, pp. i-xi, 1-612 - [j20]Yuri Levin, Adi Ben-Israel:
The Newton Bracketing Method for Convex Minimization. Comput. Optim. Appl. 21(2): 213-229 (2002) - [j19]Yuri Levin, Adi Ben-Israel:
Directional Newton methods in n variables. Math. Comput. 71(237): 251-262 (2002) - 2001
- [j18]Fuan Zhao, Adi Ben-Israel:
Envelope Theorems in Dynamic Programming. Ann. Oper. Res. 101(1-4): 383-390 (2001) - 2000
- [j17]Adi Ben-Israel:
A local inverse for nonlinear mappings. Numer. Algorithms 25(1-4): 37-46 (2000)
1990 – 1999
- 1999
- [j16]Adi Ben-Israel:
The Change-of-Variables Formula Using Matrix Volume. SIAM J. Matrix Anal. Appl. 21(1): 300-312 (1999) - 1997
- [j15]Xueqing Tang, Adi Ben-Israel:
Two consequences of Minkowski's 2n theorem. Discret. Math. 169(1-3): 279-282 (1997) - [j14]Adi Ben-Israel, Aharon Ben-Tal:
Duality and equilibrium prices in economics of uncertainty. Math. Methods Oper. Res. 46(1): 51-85 (1997) - 1993
- [b1]Wolfram Koepf, Adi Ben-Israel, Bob Gilbert:
Mathematik mit DERIVE. Vieweg 1993, ISBN 978-3-528-06549-2, pp. I-XIV, 1-394 - 1991
- [j13]Aharon Ben-Tal, Adi Ben-Israel:
A recourse certainty equivalent for decisions under uncertainty. Ann. Oper. Res. 30(1): 1-44 (1991) - 1990
- [j12]Sjur Didrik Flåm, Adi Ben-Israel:
A Continuous Approach to Oligopolistic Market Equilibrium. Oper. Res. 38(6): 1045-1051 (1990) - [j11]Adi Ben-Israel, Sjur Didrik Flåm:
A bisection/successive approximation method for computing Gittins indices. ZOR Methods Model. Oper. Res. 34(6): 411-422 (1990)
1980 – 1989
- 1987
- [j10]Manfred Grauer, Colhourn, Ludger Rüschendorf, M. L. Dowling, Adi Ben-Israel, D. Schweigert, Peter Brucker:
Book review. Z. Oper. Research 31(5) (1987)
1970 – 1979
- 1976
- [j9]Adi Ben-Israel, Aharon Ben-Tal:
On A characterization of optimality in convex programming. Math. Program. 11(1): 81-88 (1976) - 1975
- [j8]Robert A. Abrams, Adi Ben-Israel:
Technical Note - Optimality Conditions and Recession Cones. Oper. Res. 23(3): 549-553 (1975) - 1973
- [j7]Sanjo Zlobec, Adi Ben-Israel:
Technical Note - Explicit Solutions of Interval Linear Programs. Oper. Res. 21(1): 390-393 (1973) - 1971
- [j6]Luis D. Pascual, Adi Ben-Israel:
Vector-Valued Criteria in Geometric Programming. Oper. Res. 19(1): 98-104 (1971) - [j5]Abraham Berman, Adi Ben-Israel:
Linear inequalities, mathematical programming and matrix theory. Math. Program. 1(1): 291-300 (1971) - 1970
- [j4]Adi Ben-Israel, Abraham Charnes, Arthur P. Hurter, P. D. Roberts:
On the Explicit Solution of a Special Class of Linear Economic Models. Oper. Res. 18(3): 462-470 (1970) - [j3]Adi Ben-Israel, Abraham Charnes, Michael J. L. Kirby:
Letter to the Editor - On Stochastic Linear Approximation Problems. Oper. Res. 18(3): 555-558 (1970)
1960 – 1969
- 1968
- [j2]Adi Ben-Israel, Abraham Charnes:
An Explicit Solution of a Special Class of Linear Programming Problems. Oper. Res. 16(6): 1166-1175 (1968) - 1963
- [j1]Adi Ben-Israel, Stephen J. Wersan:
An Elimination Method for Computing the Generalized Inverse of an Arbitrary Complex Matrix. J. ACM 10(4): 532-537 (1963)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint