University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Narrowing the difficulty gap for the Celis-Dennis-Tapia problem

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Narrowing the difficulty gap for the Celis-Dennis-Tapia problem

Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani .

Polynomial Optimisation

We study the so-called Celis-Dennis-Tapia (CDT) problem to minimize a non-convex quadratic function over the intersection of two ellipsoids. Contrasting with the well-studied trust region problem where the feasible set is just one ellipsoid, the CDT problem seems to be not yet fully understood. Our main objective in this paper is to narrow the difficulty gap defined by curvature of the Lagrangian. We propose seemingly novel sufficient and necessary conditions for local and global optimality, and hint at algorithmic possibilities to exploit these.

Key words: Copositive matrices, non-convex optimization, optimality condition, polynomial optimization, trust region problem

Co-speaker: Michael Overton, Courant Institute of Math.~Sciences, New York University, U.S.A.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

NormangeeStar Automation and how it can help you Hybrid - Maxwell Centre & on Zoom

Other talks

Afternoon Break Title tbc Climate, uncertainty, and the slippery measurement of Antarctic ice Favourite Plants: the common, the captivating, and the curious Title TBC Good and Evil Plasma Cells: Guardians & Saboteurs of Immunity
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity