Bahman Kalantari

CoRR, 2023

A Family of Iteration Functions for General Linear Systems.

[BibT_eX]

[DOI]

CoRR, 2023

Solution of Real Cubic Equations without Cardano's Formula.

[BibT_eX]

[DOI]

CoRR, 2023

2022

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

[BibT_eX]

[DOI]

Yikai Zhang

ACM Trans. Math. Softw., 2022

Characterization of local optima of polynomial modulus over a disc.

[BibT_eX]

[DOI]

Fedor Andreev

Numer. Algorithms, 2022

2020

A Geometric Algorithm for Solving Linear Systems.

[BibT_eX]

[DOI]

Yikai Zhang

CoRR, 2020

A Globally Convergent Newton Method for Polynomials.

[BibT_eX]

[DOI]

CoRR, 2020

Robust vertex enumeration for convex hulls in high dimensions.

[BibT_eX]

[DOI]

Pranjal Awasthi

Yikai Zhang

Ann. Oper. Res., 2020

2019

An algorithmic separating hyperplane theorem and its applications.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

2018

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

[BibT_eX]

[DOI]

CoRR, 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

2017

An Invitation to Polynomiography via Exponential Series.

[BibT_eX]

[DOI]

CoRR, 2017

2016

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

[BibT_eX]

[DOI]

CoRR, 2016

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

[BibT_eX]

[DOI]

Mayank Gupta

CoRR, 2016

How Many Real Attractive Fixed Points Can A Polynomial Have?

[BibT_eX]

[DOI]

Terence Coelho

CoRR, 2016

2015

A characterization theorem and an algorithm for a convex hull problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2015

2014

Newton-Ellipsoid Method and its Polynomiography.

[BibT_eX]

[DOI]

Eric Lee

CoRR, 2014

Randomized Triangle Algorithms for Convex Hull Membership.

[BibT_eX]

[DOI]

CoRR, 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Solving Cubic Equations By the Quadratic Formula.

[BibT_eX]

[DOI]

CoRR, 2014

Algorithms and Polynomiography for Solving Quaternion Quadratic Equations.

[BibT_eX]

[DOI]

Fedor Andreev

CoRR, 2014

Fast Approximation and Randomized Algorithms for Diameter.

[BibT_eX]

[DOI]

Sharareh Alipour

Hamid Homapour

CoRR, 2014

2013

The State of the Art of Voronoi Diagram Research.

[BibT_eX]

[DOI]

Trans. Comput. Sci., 2013

On Properties of Forbidden Zones of Polygons and Polytopes.

[BibT_eX]

[DOI]

Trans. Comput. Sci., 2013

Algorithms for quaternion polynomial root-finding.

[BibT_eX]

[DOI]

J. Complex., 2013

2012

Solving Linear System of Equations Via A Convex Hull Algorithm

[BibT_eX]

[DOI]

CoRR, 2012

Voronoi Diagram Properties in Polynomials with Polynomiography Applications and Extensions.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Symposium on Voronoi Diagrams in Science and Engineering, 2012

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

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Mollified Zone Diagrams and Their Computation.

[BibT_eX]

[DOI]

Sergio Coutinho de Biasi

Iraj Kalantari

Trans. Comput. Sci., 2011

A Geometric Modulus Principle for Polynomials.

[BibT_eX]

[DOI]

Am. Math. Mon., 2011

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

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2011

Alternating Sign Matrices and Polynomiography.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

2010

Maximal Zone Diagrams and their Computation.

[BibT_eX]

[DOI]

Sergio Coutinho de Biasi

Iraj Kalantari

Proceedings of the Seventh International Symposium on Voronoi Diagrams in Science and Engineering, 2010

2009

Voronoi Diagrams and Polynomial Root-Finding.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Symposium on Voronoi Diagrams, 2009

2008

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

[BibT_eX]

[DOI]

Math. Program., 2008

2005

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

[BibT_eX]

[DOI]

Math. Comput., 2005

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

[BibT_eX]

[DOI]

Math. Comput., 2005

Symmetric functions and root-finding algorithms.

[BibT_eX]

[DOI]

Yi Jin

Adv. Appl. Math., 2005

2004

Polynomiography and applications in art, education, and science.

[BibT_eX]

[DOI]

Comput. Graph., 2004

Animation of mathematical concepts using polynomiography.

[BibT_eX]

[DOI]

Iraj Kalantari

Fedor Andreev

Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2004

2000

New formulas for approximation of π and other transcendental numbers.

[BibT_eX]

[DOI]

Numer. Algorithms, 2000

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

[BibT_eX]

[DOI]

Proceedings of the Unusual Applications of Number Theory, 2000

1997

On the Complexity of Matrix Balancing.

[BibT_eX]

[DOI]

Ali Shokoufandeh

SIAM J. Matrix Anal. Appl., April, 1997

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

[BibT_eX]

[DOI]

Celina Imielinska

Algorithmica, 1997

1996

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

[BibT_eX]

[DOI]

Gholamreza B. Khosrovshahi

Networks, 1996

1993

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

[BibT_eX]

[DOI]

Oper. Res. Lett., 1993

A greedy heuristic for a minimum-weight forest problem.

[BibT_eX]

[DOI]

Celina Imielinska

Oper. Res. Lett., 1993

A Generalized Hypergreedy Algorithm for Weighted Perfect Matching.

[BibT_eX]

[DOI]

Celina Imielinska

BIT, 1993

1992

Diagonal Matrix Scaling and Linear Programming.

[BibT_eX]

[DOI]

SIAM J. Optim., 1992

Generalization of Karmarkar's algorithm to convex homogeneous functions.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1992

1990

Karmarkar's Algorithm with Improved Steps.

[BibT_eX]

[DOI]

Math. Program., 1990

1989

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

[BibT_eX]

[DOI]

Ömer Egecioglu

Inf. Process. Lett., 1989

1988

A new class of heuristic algorithms for weighted perfect matching.

[BibT_eX]

[DOI]

Michael D. Grigoriadis

J. ACM, 1988

1987

An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions.

[BibT_eX]

[DOI]

J. Ben Rosen

Math. Oper. Res., 1987

Penalty formulation for zero-one nonlinear programming.

[BibT_eX]

[DOI]

J. Ben Rosen

Discret. Appl. Math., 1987

1986

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

[BibT_eX]

[DOI]

Michael D. Grigoriadis

Inf. Process. Lett., 1986

1985

Technical Note - Construction of Difficult Linearly Constrained Concave Minimization Problems.

[BibT_eX]

[DOI]

Oper. Res., 1985

1982

Penalty for zero-one integer equivalent problem.

[BibT_eX]

[DOI]