Farid Alizadeh

According to our database, Farid Alizadeh authored at least 22 papers between 1991 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2022

A branch-and-bound method for the minimum <i>k</i>-enclosing ball problem.

Marta Cavaleiro, Farid Alizadeh

Oper. Res. Lett., 2022

2021

A dual simplex-type algorithm for the smallest enclosing ball of balls.

Marta Cavaleiro, Farid Alizadeh

Comput. Optim. Appl., 2021

2019

Preface.

Farid Alizadeh, Douglas Soares Gonçalves, Nathan Krislock, Leo Liberti

Discret. Appl. Math., 2019

2018

Preface: Special issue dedicated to Distance Geometry.

Farid Alizadeh, Douglas Soares Gonçalves, Nathan Krislock, Leo Liberti

J. Glob. Optim., 2018

2017

A branch-and-bound algorithm for the minimum radius $k$-enclosing ball problem.

Marta Cavaleiro, Farid Alizadeh

CoRR, 2017

2013

Semidefinite Characterization of Sum-of-Squares Cones in Algebras.

Dávid Papp, Farid Alizadeh

SIAM J. Optim., 2013

Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming.

Farid Alizadeh, Dávid Papp

Ann. Oper. Res., 2013

2011

Bilinear optimality constraints for the cone of positive polynomials.

Gábor Rudolf, Nilay Noyan, Dávid Papp, Farid Alizadeh

Math. Program., 2011

The <i>Q</i> Method for Symmetric Cone Programming.

Farid Alizadeh, Yu Xia

J. Optim. Theory Appl., 2011

Multivariate arrival rate estimation using semidefinite programming.

Dávid Papp, Farid Alizadeh

Proceedings of the Winter Simulation Conference 2011, 2011

2008

Arrival Rate Approximation by Nonnegative Cubic Splines.

Farid Alizadeh, Jonathan Eckstein, Nilay Noyan, Gábor Rudolf

Oper. Res., 2008

The Q method for second order cone programming.

Yu Xia, Farid Alizadeh

Comput. Oper. Res., 2008

2003

Extension of primal-dual interior point algorithms to symmetric cones.

S. H. Schmieta, Farid Alizadeh

Math. Program., 2003

Second-order cone programming.

Farid Alizadeh, Donald Goldfarb

Math. Program., 2003

2001

Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones.

S. H. Schmieta, Farid Alizadeh

Math. Oper. Res., 2001

1998

Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results.

Farid Alizadeh, Jean-Pierre A. Haeberly, Michael L. Overton

SIAM J. Optim., 1998

1997

Complementarity and nondegeneracy in semidefinite programming.

Farid Alizadeh, Jean-Pierre A. Haeberly, Michael L. Overton

Math. Program., 1997

1995

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization.

Farid Alizadeh

SIAM J. Optim., 1995

Physical Mapping of Chromosomes Using Unique Probes.

Farid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig

J. Comput. Biol., 1995

Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology.

Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser

Algorithmica, 1995

1992

Combinatorial Optimization with Semi-Definite Matrices.

Farid Alizadeh

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991

A Sublinear-Time Randomized Parallel Algorithm for the Maximum Clique Problem in Perfect Graphs.

Farid Alizadeh

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991