Bahman Kalantari

Publication Activity (10 Years)

Years Active: 1982-2023
Publications (10 Years): 20

Top Topics

Separating Hyperplane

Top Venues

Ann. Oper. Res.

Trans. Comput. Sci.

Publications

Bahman Kalantari
Solution of Real Cubic Equations without Cardano's Formula. CoRR (2023)
Chun Lau, Bahman Kalantari
On the Performance of a Novel Class of Linear System Solvers and Comparison with State-of-The-Art Algorithms. CoRR (2023)
Bahman Kalantari
A Family of Iteration Functions for General Linear Systems. CoRR (2023)
Bahman Kalantari, Fedor Andreev, Chun Lau
Characterization of local optima of polynomial modulus over a disc. Numer. Algorithms 90 (2) (2022)
Bahman Kalantari, Yikai Zhang
Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries. ACM Trans. Math. Softw. 48 (2) (2022)
Pranjal Awasthi, Bahman Kalantari, Yikai Zhang
Robust vertex enumeration for convex hulls in high dimensions. Ann. Oper. Res. 295 (1) (2020)
Bahman Kalantari
A Globally Convergent Newton Method for Polynomials. CoRR (2020)
Bahman Kalantari, Chun Lau, Yikai Zhang
A Geometric Algorithm for Solving Linear Systems. CoRR (2020)
Bahman Kalantari
On the Equivalence of SDP Feasibility and a Convex Hull Relaxation for System of Quadratic Equations. CoRR (2019)
Bahman Kalantari
An algorithmic separating hyperplane theorem and its applications. Discret. Appl. Math. 256 (2019)
Bahman Kalantari
A Triangle Algorithm for Semidefinite Version of Convex Hull Membership Problem. CoRR (2019)
Bahman Kalantari, Chun Lau
The Multilinear Minimax Relaxation of Bimatrix Games and Comparison with Nash Equilibria via Lemke-Howson. CoRR (2018)
Pranjal Awasthi, Bahman Kalantari, Yikai Zhang
Robust Vertex Enumeration for Convex Hulls in High Dimensions. AISTATS (2018)
Bahman Kalantari
An O(1/ε)-Iteration Triangle Algorithm for A Convex Hull Membership. CoRR (2018)
Pranjal Awasthi, Bahman Kalantari, Yikai Zhang
Robust Vertex Enumeration for Convex Hulls in High Dimensions. CoRR (2018)
Bahman Kalantari
An Invitation to Polynomiography via Exponential Series. CoRR (2017)
Bahman Kalantari
A Necessary and Sufficient Condition for Local Maxima of Polynomial Modulus Over Unit Disc. CoRR (2016)
Bahman Kalantari
Approximating Nash Equilibrium Via Multilinear Minimax. CoRR (2016)
Mayank Gupta, Bahman Kalantari
A Comparison of the Triangle Algorithm and SMO for Solving the Hard Margin Problem. CoRR (2016)
Terence Coelho, Bahman Kalantari
How Many Real Attractive Fixed Points Can A Polynomial Have? CoRR (2016)
Bahman Kalantari
A characterization theorem and an algorithm for a convex hull problem. Ann. Oper. Res. 226 (1) (2015)
Fedor Andreev, Bahman Kalantari
Algorithms and Polynomiography for Solving Quaternion Quadratic Equations. CoRR (2014)
Bahman Kalantari
Randomized Triangle Algorithms for Convex Hull Membership. CoRR (2014)
Bahman Kalantari
A One-Line Proof of the Fundamental Theorem of Algebra with Newton's Method as a Consequence. CoRR (2014)
Bahman Kalantari, Eric Lee
Newton-Ellipsoid Method and its Polynomiography. CoRR (2014)
Sharareh Alipour, Bahman Kalantari, Hamid Homapour
Fast Approximation and Randomized Algorithms for Diameter. CoRR (2014)
Bahman Kalantari
An Algorithmic Separating Hyperplane Theorem and Its Applications. CoRR (2014)
Bahman Kalantari
Solving Cubic Equations By the Quadratic Formula. CoRR (2014)
Ross Berkowitz, Bahman Kalantari, Iraj Kalantari, David Menendez
On Properties of Forbidden Zones of Polygons and Polytopes. Trans. Comput. Sci. 20 (2013)
Bahman Kalantari
Algorithms for quaternion polynomial root-finding. J. Complex. 29 (3-4) (2013)
Bahman Kalantari
The State of the Art of Voronoi Diagram Research. Trans. Comput. Sci. 20 (2013)
Bahman Kalantari
Solving Linear System of Equations Via A Convex Hull Algorithm CoRR (2012)
Bahman Kalantari
A Characterization Theorem and An Algorithm for A Convex Hull Problem CoRR (2012)
Ross Berkowitz, Bahman Kalantari, David Menendez, Iraj Kalantari
On Properties of Forbidden Zones of Polygons and Polytopes. ISVD (2012)
Bahman Kalantari
Voronoi Diagram Properties in Polynomials with Polynomiography Applications and Extensions. ISVD (2012)
Bahman Kalantari
Finding a Lost Treasure in Convex Hull of Points From Known Distances. CCCG (2012)
Bahman Kalantari
A Geometric Modulus Principle for Polynomials. Am. Math. Mon. 118 (10) (2011)
Sergio Coutinho de Biasi, Bahman Kalantari, Iraj Kalantari
Mollified Zone Diagrams and Their Computation. Trans. Comput. Sci. 14 (2011)
Bahman Kalantari
Alternating Sign Matrices and Polynomiography. Electron. J. Comb. 18 (2) (2011)
Bahman Kalantari
Polynomial Root-Finding Methods Whose Basins of Attraction Approximate Voronoi Diagram. Discret. Comput. Geom. 46 (1) (2011)
Sergio Coutinho de Biasi, Bahman Kalantari, Iraj Kalantari
Maximal Zone Diagrams and their Computation. ISVD (2010)
Bahman Kalantari
Voronoi Diagrams and Polynomial Root-Finding. ISVD (2009)
Bahman Kalantari, Isabella Lari, Federica Ricca, Bruno Simeone
On the complexity of general matrix scaling and entropy minimization via the RAS algorithm. Math. Program. 112 (2) (2008)
Bahman Kalantari
An infinite family of bounds on zeros of analytic functions and relationship to Smale's bound. Math. Comput. 74 (250) (2005)
Yi Jin, Bahman Kalantari
Symmetric functions and root-finding algorithms. Adv. Appl. Math. 34 (1) (2005)
Bahman Kalantari
Corrigendum to "An infinite family of bounds on zeros of analytic functions and relationship to Smale's bound". Math. Comput. 74 (252) (2005)
Bahman Kalantari, Iraj Kalantari, Fedor Andreev
Animation of mathematical concepts using polynomiography. SIGGRAPH Educators Program (2004)
Bahman Kalantari
Polynomiography and applications in art, education, and science. Comput. Graph. 28 (3) (2004)
Bahman Kalantari
Polynomiography and applications in art, education, and science. SIGGRAPH Educators Program (2003)
Bahman Kalantari
On homogeneous linear recurrence relations and approximation of zeros of complex polynomials. Unusual Applications of Number Theory (2000)
Bahman Kalantari
New formulas for approximation of π and other transcendental numbers. Numer. Algorithms 24 (1-2) (2000)
Bahman Kalantari, Leonid Khachiyan, Ali Shokoufandeh
On the Complexity of Matrix Balancing. SIAM J. Matrix Anal. Appl. 18 (2) (1997)
Celina Imielinska, Bahman Kalantari
A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic Errors. Algorithmica 18 (4) (1997)
Bahman Kalantari, Gholamreza B. Khosrovshahi
Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP. Networks 28 (4) (1996)
Bahman Kalantari, Leonid Khachiyan
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms. Oper. Res. Lett. 14 (5) (1993)
Celina Imielinska, Bahman Kalantari
A Generalized Hypergreedy Algorithm for Weighted Perfect Matching. BIT 33 (2) (1993)
Celina Imielinska, Bahman Kalantari, Leonid Khachiyan
A greedy heuristic for a minimum-weight forest problem. Oper. Res. Lett. 14 (2) (1993)
Leonid Khachiyan, Bahman Kalantari
Diagonal Matrix Scaling and Linear Programming. SIAM J. Optim. 2 (4) (1992)
Bahman Kalantari
Generalization of Karmarkar's algorithm to convex homogeneous functions. Oper. Res. Lett. 11 (2) (1992)
Bahman Kalantari
Karmarkar's Algorithm with Improved Steps. Math. Program. 46 (1990)
Ömer Egecioglu, Bahman Kalantari
Approximating the Diameter of a Set of Points in the Euclidean Space. Inf. Process. Lett. 32 (4) (1989)
Michael D. Grigoriadis, Bahman Kalantari
A new class of heuristic algorithms for weighted perfect matching. J. ACM 35 (4) (1988)
Bahman Kalantari, J. Ben Rosen
An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions. Math. Oper. Res. 12 (3) (1987)
Bahman Kalantari, J. Ben Rosen
Penalty formulation for zero-one nonlinear programming. Discret. Appl. Math. 16 (2) (1987)
Michael D. Grigoriadis, Bahman Kalantari
A Lower Bound to the Complexity of Euclidean and Rectilinear Matching Algorithms. Inf. Process. Lett. 22 (2) (1986)
Bahman Kalantari
Technical Note - Construction of Difficult Linearly Constrained Concave Minimization Problems. Oper. Res. 33 (1) (1985)
Bahman Kalantari, J. Ben Rosen
Penalty for zero-one integer equivalent problem. Math. Program. 24 (1) (1982)