Bahman Kalantari

发表

A Geometric Modulus Principle for Polynomials

Bahman Kalantari, 2011, Am. Math. Mon..

An infinite family of bounds on zeros of analytic functions and relationship to Smale's bound

Bahman Kalantari, B. Kalantari, 2004, Math. Comput..

Approximating Nash Equilibrium Via Multilinear Minimax pdf

Bahman Kalantari, 2016, ArXiv.

A new class of heuristic algorithms for weighted perfect matching

Michael D. Grigoriadis, Bahman Kalantari, M. Grigoriadis, 1988, JACM.

Finding a Lost Treasure in Convex Hull of Points From Known Distances

Bahman Kalantari, 2012, CCCG.

A Geometric Algorithm for Solving Linear Systems pdf

Yikai Zhang, Bahman Kalantari, Chun Lau, 2020, ArXiv.

An Algorithmic Separating Hyperplane Theorem and Its Applications pdf

Bahman Kalantari, B. Kalantari, 2014, Discret. Appl. Math..

Basic Family as Dynamical System

Bahman Kalantari, 2008 .

Polynomiography and Chaos

Bahman Kalantari, 2013, CCS 2013.

Transactions on Computational Science XX

Marina L. Gavrilova, Bahman Kalantari, C. J. Kenneth Tan, 2013, Lecture Notes in Computer Science.

Penalty for zero–one integer equivalent problem

J. Ben Rosen, Bahman Kalantari, 1982, Math. Program..

A generalized hypergreedy algorithm for weighted perfect matching

Bahman Kalantari, Celina Imielinska, B. Kalantari, 1993, BIT.

An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions

J. Ben Rosen, Bahman Kalantari, J. B. Rosen, 1987, Math. Oper. Res..

Approximating the Diameter of a Set of Points in the Euclidean Space

Ömer Egecioglu, Bahman Kalantari, 1989, Inf. Process. Lett..

An O(1/ε)-Iteration Triangle Algorithm for A Convex Hull Membership pdf

Bahman Kalantari, 2018, ArXiv.

Symmetric functions and root-finding algorithms

Bahman Kalantari, Yi Jin, B. Kalantari, 2005, Adv. Appl. Math..

Diagonal Matrix Scaling and Linear Programming

Leonid Khachiyan, Bahman Kalantari, L. Khachiyan, 1992, SIAM J. Optim..

A Triangle Algorithm for Semidefinite Version of Convex Hull Membership Problem pdf

Bahman Kalantari, B. Kalantari, 2019, ArXiv.

Two and Three-Dimensional Art Inspired by Polynomiography

Bahman Kalantari, 2005 .

Algorithms for quaternion polynomial root-finding

Bahman Kalantari, B. Kalantari, 2013, J. Complex..

An Invitation to Polynomiography via Exponential Series pdf

Bahman Kalantari, 2017, ArXiv.

Penalty formulation for zero-one nonlinear programming

J. Ben Rosen, Bahman Kalantari, J. B. Rosen, 1987, Discret. Appl. Math..

A new visual art medium: polynomiography

Bahman Kalantari, 2004, COMG.

On Properties of Forbidden Zones of Polygons and Polytopes

Bahman Kalantari, Iraj Kalantari, David Menendez, 2012, 2012 Ninth International Symposium on Voronoi Diagrams in Science and Engineering.

Mollified Zone Diagrams and Their Computation

Bahman Kalantari, Iraj Kalantari, Sergio Coutinho de Biasi, 2011, Trans. Comput. Sci..

A Lower Bound to the Complexity of Euclidean and Rectilinear Matching Algorithms

Michael D. Grigoriadis, Bahman Kalantari, 1986, Inf. Process. Lett..

Randomized Triangle Algorithms for Convex Hull Membership pdf

Bahman Kalantari, B. Kalantari, 2014, ArXiv.

Voronoi Diagrams and Polynomial Root-Finding

Bahman Kalantari, 2009, 2009 Sixth International Symposium on Voronoi Diagrams.

On Properties of Forbidden Zones of Polygons and Polytopes

Bahman Kalantari, Iraj Kalantari, David Menendez, 2012, ISVD.

The State of the Art of Voronoi Diagram Research

Bahman Kalantari, 2013, Trans. Comput. Sci..

Applications of Polynomiography in Art, Education, Science and Mathematics

Bahman Kalantari, 2008 .

Fast Approximation and Randomized Algorithms for Diameter pdf

Bahman Kalantari, Sharareh Alipour, Hamid Homapour, 2014, ArXiv.

Foreword from the Editors

Marina L. Gavrilova, Bahman Kalantari, 2012 .

POLYNOMIOGRAPHY IN ART AND DESIGN

Bahman Kalantari, 2004 .

Technical Note - Construction of Difficult Linearly Constrained Concave Minimization Problems

Bahman Kalantari, 1985, Oper. Res..

Corrigendum to "An infinite family of bounds on zeros of analytic functions and relationship to Smale's bound"

Bahman Kalantari, 2005, Math. Comput..

Polynomial Root-Finding Methods Whose Basins of Attraction Approximate Voronoi Diagram

Bahman Kalantari, B. Kalantari, 2011, Discret. Comput. Geom..

Animation of mathematical concepts using polynomiography

Bahman Kalantari, Iraj Kalantari, Fedor Andreev, 2004, SIGGRAPH '04.

A Comparison of the Triangle Algorithm and SMO for Solving the Hard Margin Problem pdf

Bahman Kalantari, Mayank Gupta, B. Kalantari, 2016, ArXiv.

Generalization of Karmarkar's algorithm to convex homogeneous functions

Bahman Kalantari, B. Kalantari, 1992, Oper. Res. Lett..

Polynomiography and applications in art, education, and science

Bahman Kalantari, 2004, Comput. Graph..

On the complexity of general matrix scaling and entropy minimization via the RAS algorithm

Bahman Kalantari, Isabella Lari, Bruno Simeone, 2007, Math. Program..

Polynomiography: Algorithms for Visualization of Polynomial Equations

Bahman Kalantari, 2008 .

On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms

Leonid Khachiyan, Bahman Kalantari, L. Khachiyan, 1993, Oper. Res. Lett..

A characterization theorem and an algorithm for a convex hull problem

Bahman Kalantari, B. Kalantari, 2012, Ann. Oper. Res..

New formulas for approximation of π and other transcendental numbers

Bahman Kalantari, 2004, Numerical Algorithms.

A Globally Convergent Newton Method for Polynomials pdf

Bahman Kalantari, B. Kalantari, 2020, ArXiv.

Further Applications and Extensions of the Basic Family and Polynomiography

Bahman Kalantari, 2008 .

The title and abstract of the lecture by Prof. Kalantari is as follows : Solving for The Unknown : Foundation of Math and Art

Bahman Kalantari, 2010 .

On the Equivalence of SDP Feasibility and a Convex Hull Relaxation for System of Quadratic Equations pdf

Bahman Kalantari, 2019, ArXiv.

Solving Linear System of Equations Via A Convex Hull Algorithm pdf

Bahman Kalantari, B. Kalantari, 2012, ArXiv.

A greedy heuristic for a minimum-weight forest problem

Leonid Khachiyan, Bahman Kalantari, Celina Imielinska, 1993, Oper. Res. Lett..

Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP

Gholamreza B. Khosrovshahi, Bahman Kalantari, 1996, Networks.

Alternating Sign Matrices and Polynomiography

Bahman Kalantari, B. Kalantari, 2011, Electron. J. Comb..

A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic Errors

Bahman Kalantari, Celina Imielinska, B. Kalantari, 1997, Algorithmica.

Karmarkar's algorithm with improved steps

Bahman Kalantari, B. Kalantari, 1990, Math. Program..

Voronoi Diagram Properties in Polynomials with Polynomiography Applications and Extensions

Bahman Kalantari, B. Kalantari, 2012, 2012 Ninth International Symposium on Voronoi Diagrams in Science and Engineering.

How Many Real Attractive Fixed Points Can A Polynomial Have? pdf

Bahman Kalantari, Terence Coelho, 2016, ArXiv.

Polynomiography and applications in art, education, and science

Bahman Kalantari, B. Kalantari, 2003, SIGGRAPH '03.

Newton-Ellipsoid Method and its Polynomiography pdf

Bahman Kalantari, Eric Lee, 2014, ArXiv.

The Multipoint Basic Family and its Order of Convergence

Bahman Kalantari, 2008 .

A Computational Study of the Multipoint Basic Family

Bahman Kalantari, 2008 .

Maximal Zone Diagrams and their Computation

Bahman Kalantari, Iraj Kalantari, Sergio Coutinho de Biasi, 2010, 2010 International Symposium on Voronoi Diagrams in Science and Engineering.

Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries

Yikai Zhang, Bahman Kalantari, 2018 .

The Multilinear Minimax Relaxation of Bimatrix Games and Comparison with Nash Equilibria via Lemke-Howson pdf

Bahman Kalantari, Chun Lau, 2018, ArXiv.

Polynomiography: From the Fundamental Theorem of Algebra to Art

Bahman Kalantari, B. Kalantari, 2005, Leonardo.

An algorithm for the traveling salesman problem with pickup and delivery customers

Arthur V. Hill, Bahman Kalantari, Sant Arora, 1985 .

Robust vertex enumeration for convex hulls in high dimensions

Bahman Kalantari, Pranjal Awasthi, Yikai Zhang, 2018, AISTATS.

A Necessary and Sufficient Condition for Local Maxima of Polynomial Modulus Over Unit Disc pdf

Bahman Kalantari, B. Kalantari, 2016, ArXiv.

Solving Cubic Equations By the Quadratic Formula pdf

Bahman Kalantari, 2014, ArXiv.

Algorithms and Polynomiography for Solving Quaternion Quadratic Equations pdf

Bahman Kalantari, Fedor Andreev, 2014, ArXiv.

A One-Line Proof of the Fundamental Theorem of Algebra with Newton's Method as a Consequence pdf

Bahman Kalantari, 2014, ArXiv.

On homogeneous linear recurrence relations and approximation of zeros of complex polynomials

Bahman Kalantari, B. Kalantari, 2000, Unusual Applications of Number Theory.

Characterization of local optima of polynomial modulus over a disc

Bahman Kalantari, Fedor Andreev, Chun Lau, 2021, Numerical Algorithms.

A computational comparison of the first nine members of a determinantal family of root-finding methods

Bahman Kalantari, Seungyoung Park, B. Kalantari, 2001 .

An $O(1/\varepsilon)$-Iteration Triangle Algorithm for A Convex Hull Membership

Bahman Kalantari, 2018 .

The Art in Polynomiography of Special Polynomials

Bahman Kalantari, B. Kalantari, 2003 .

Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications

Bahman Kalantari, B. Kalantari, 2000 .

Large scale global minimization of linearly constrained concave quadratic functions and related problems

Bahman Kalantari, B. Kalantari, 1984 .

Sharp bounds for the maximum of the chi-square index in a class of contingency tables with given marginals

Alfredo Rizzi, Bahman Kalantari, Isabella Lari, 1993 .

A basic family of iteration functions for polynomial root finding and its characterizations

Bahman Kalantari, Iraj Kalantari, Rahim Zaare-Nahandi, 1997 .

Halley's Method as the First Member of an Infinite Family of Cubic Order Rootfinding Methods

Bahman Kalantari, B. Kalantari, 1998 .

On general convergence in extracting radicals via a fundamental family of iteration functions

Bahman Kalantari, Yi Jin, B. Kalantari, 2007 .

Experiments with The Triangle Algorithm for Linear Systems ∗

Thomas H. Gibson, Bahman Kalantari, 2013 .

An algorithm for quadratic zero-one programs

Bahman Kalantari, B. Kalantari, A. Bagchi, 1990 .

A Lower Bound On Determinants From Linear Programming

Bahman Kalantari, 1994 .

Newton's method and generation of a determinantal family of iteration functions

Bahman Kalantari, B. Kalantari, J. Gerlach, 2000 .

A Linear-Time Algorithm for Minimum Cost Flow on Undirected One-Trees

Bahman Kalantari, Iraj Kalantari, 1995 .

A determinantal lower bound

Bahman Kalantari, Thomas H. Pate, 2001 .

On the existence of weak greedy matching heuristics

Michael D. Grigoriadis, Bahman Kalantari, C. Y Lai, 1986 .

A procedure of Chvátal for testing feasibility in linear programming and matrix scaling

Bahman Kalantari, Yi Jin, B. Kalantari, 2006 .

On Extraneous Fixed-Points of the Basic Family of Iteration Functions

Bahman Kalantari, B. Kalantari, Y. Jin, 2003 .

Generalization Of Taylor's Theorem And Newton's Method Via A New Family Of Determinantal Interpolation Formulas

Bahman Kalantari, B. Kalantari, 2000 .

On the Order of Convergence of a Determinantal Family of Root-Finding Methods

Bahman Kalantari, B. Kalantari, 1999 .

Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP

Gholamreza B. Khosrovshahi, Bahman Kalantari, 1996 .

Approximation Schemes For Maximum Cardinality Matching

Ali Shokoufandeh, Bahman Kalantari, A. Shokoufandeh, 1995 .