The following pages link to Farid Alizadeh (Q378747):
Displaying 17 items.
- Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming (Q378749) (← links)
- The \(Q\) method for symmetric cone programming (Q639204) (← links)
- Bilinear optimality constraints for the cone of positive polynomials (Q717131) (← links)
- Complementarity and nondegeneracy in semidefinite programming (Q1373731) (← links)
- (Q1404229) (redirect page) (← links)
- Extension of primal-dual interior point algorithms to symmetric cones (Q1404230) (← links)
- Physical mapping of chromosomes: A combinatorial problem in molecular biology (Q1902467) (← links)
- A dual simplex-type algorithm for the smallest enclosing ball of balls (Q2044498) (← links)
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem (Q2157894) (← links)
- The \(Q\) method for second order cone programming (Q2459387) (← links)
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones (Q2757681) (← links)
- Semidefinite Characterization of Sum-of-Squares Cones in Algebras (Q2866191) (← links)
- (Q3128911) (← links)
- (Q3138953) (← links)
- (Q3140441) (← links)
- Arrival Rate Approximation by Nonnegative Cubic Splines (Q3392161) (← links)
- A faster dual algorithm for the Euclidean minimum covering ball problem (Q6288506) (← links)
