Bahman Kalantari

67 papers A 1Journal 57Unranked 8

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