#### Filter Results:

- Full text PDF available (18)

#### Publication Year

2001

2017

- This year (0)
- Last 5 years (7)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- E. Alper Yildirim, Stephen J. Wright
- SIAM Journal on Optimization
- 2002

We study the situation in which, having solved a linear program with an interiorpoint method, we are presented with a new problem instance whose data is slightly perturbed from the original. Weâ€¦ (More)

- Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim
- ACM Journal of Experimental Algorithmics
- 2003

We study the minimum enclosing ball (MEB) problem for sets of points or balls in high dimensions. Using techniques of second-order cone programming and "core-sets", we have developed (1 +â€¦ (More)

- Serkan Kiranyaz, Turker Ince, E. Alper Yildirim, Moncef Gabbouj
- Neural Networks
- 2009

In this paper, we propose a novel technique for the automatic design of Artificial Neural Networks (ANNs) by evolving to the optimal network configuration(s) within an architecture space. It isâ€¦ (More)

- Serkan Kiranyaz, Turker Ince, E. Alper Yildirim, Moncef Gabbouj
- IEEE Transactions on Systems, Man, andâ€¦
- 2010

In this paper, we propose two novel techniques, which successfully address several major problems in the field of particle swarm optimization (PSO) and promise a significant breakthrough over complexâ€¦ (More)

- Michael J. Todd, E. Alper Yildirim
- Discrete Applied Mathematics
- 2007

Given A := {a1, . . . , am} âŠ‚ Rd whose affine hull is Rd , we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum-volume enclosingâ€¦ (More)

- Elizabeth John, E. Alper Yildirim
- Comp. Opt. and Appl.
- 2008

We implement several warm-start strategies in interior-point methods for linear programming (LP). We study the situation in which both the original LP instance and the perturbed one have exactly theâ€¦ (More)

- E. Alper Yildirim
- SIAM Journal on Optimization
- 2006

Let S denote the convex hull of m full-dimensional ellipsoids in Rn. Given > 0 and Î´ > 0, we study the problems of computing a (1 + )-approximation to the minimum volume covering ellipsoid of S and aâ€¦ (More)

- E. Alper Yildirim, Michael J. Todd
- Math. Program.
- 2001

We analyze perturbations of the right-hand side and the cost parameters in linear programming (LP) and semidefinite programming (SDP). We obtain tight bounds on the norm of the perturbations thatâ€¦ (More)

- E. Alper Yildirim
- Optimization Methods and Software
- 2012

We consider linear optimization problems over the cone of copositive matrices. Such conic optimization problems, called copositive programs, arise from the reformulation of a wide variety ofâ€¦ (More)

- E. Alper Yildirim
- SIAM Journal on Optimization
- 2008

Given A := {a1, . . . , am} âŠ‚ Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball of A. The firstâ€¦ (More)