Wyniki wyszukiwania:

His freshman year of college, Alex Lemon was supposed to be the star catcher on the Macalester College baseball team. He was the boy getting every girl, the hard-partying kid everyone called Happy. In the spring of 1997, he had his first stroke. For two years Lemon coped with his deteriorating health by sinking deeper into alcohol and drug abuse. His charming and carefree exterior masked his self-destructive and sometimes cruel behavior as he endured two more brain bleeds and a crippling depression. After undergoing brain surgery, he is nursed back to health by his free-spirited artist...

Alex Lemon's work defies categorization. Stark juxtaposition of images evokes the New York School, verbal collages suggest the associative method of the postmodernists, and his playful attention to sound recalls elements of Language School poetry. While these elements surface in Lemon's work, his poetry remains profoundly original, his voice remarkably distinct. Lemon is also, like Frank O'Hara, an autobiographical poet, using the materials of life for inspiration. At 29, he is already a survivor of brain surgery. Still coping with the surgery's effects, including a gradual loss of vision, he...

In his first collection since Fancy Beasts, a book that "slice d] straight through nerve and marrow on its way to the heart and mind of the matter" (Tracy K. Smith), Alex Lemon dazzles us again with his exuberance and candor. Whether in unrestrained descriptions of sensory overload or tender meditations on fatherhood and mortality, Lemon blurs that nebulous line between the personal and the pop-cultural. These poems are full of frenetic energy and images pleasantly, strangely colliding: jigsaws and bathtubs and kung-fu and X-rays. It's a distinct brand of edginess that readers of Lemon...

Finding low-rank solutions of semidefinite programs is important in many applications. For example, semidefinite programs that arise as relaxations of polynomial optimization problems are exact relaxations when the semidefinite program has a rank-1 solution. Unfortunately, computing a minimum-rank solution of a semidefinite program is an NP-hard problem. This monograph reviews the theory of low-rank semidefinite programming, presenting theorems that guarantee the existence of a low-rank solution, heuristics for computing low-rank solutions, and algorithms for finding low-rank approximate...