# Copositive Programming and Related Problems

Research output: ThesisPhD Thesis - Research UT, graduation UT

### Abstract

Foundation of mathematical optimization relies on the urge to utilize available resources to their optimum. This leads to mathematical programs where an objective function is optimized over a set of constraints. The set of constraints can represent different structures, for example, a polyhedron, a box or a cone. Mathematical programs with cone constraints are called cone programs. A sub area of mathematical optimization is the one where the number of variables isfinite while the number of constraints is infinite, known as semi-infinite programming. In the first section of Chapter 1 we will start with a general introduction into the thesis. In the second section some basic definitions are given which are used throughout the thesis. The third and the fourth section provide a brief review of results on cone programming and semi-infinite programming, respectively. In section five we will briefly discuss cone programming relaxations. In the last section we shall give an overview over results presented in the thesis.
Original language Undefined University of Twente Uetz, Marc Jochen, SupervisorStill, Georg Josef, Advisor Higher Education Commission of Pakistan 28 May 2014 Enschede Universiteit Twente 978-90-365-3672-1 https://doi.org/10.3990/1.9789036536721 Published - 28 May 2014

• EWI-24809
• IR-91101
• METIS-303647

### Cite this

Ahmed, F.. / Copositive Programming and Related Problems. Enschede : Universiteit Twente, 2014. 123 p.
@phdthesis{046752af23e140e9a360eaed4a480b9a,
title = "Copositive Programming and Related Problems",
abstract = "Foundation of mathematical optimization relies on the urge to utilize available resources to their optimum. This leads to mathematical programs where an objective function is optimized over a set of constraints. The set of constraints can represent different structures, for example, a polyhedron, a box or a cone. Mathematical programs with cone constraints are called cone programs. A sub area of mathematical optimization is the one where the number of variables isfinite while the number of constraints is infinite, known as semi-infinite programming. In the first section of Chapter 1 we will start with a general introduction into the thesis. In the second section some basic definitions are given which are used throughout the thesis. The third and the fourth section provide a brief review of results on cone programming and semi-infinite programming, respectively. In section five we will briefly discuss cone programming relaxations. In the last section we shall give an overview over results presented in the thesis.",
keywords = "EWI-24809, IR-91101, METIS-303647",
author = "F. Ahmed",
year = "2014",
month = "5",
day = "28",
doi = "10.3990/1.9789036536721",
language = "Undefined",
isbn = "978-90-365-3672-1",
publisher = "Universiteit Twente",
school = "University of Twente",

}

Enschede : Universiteit Twente, 2014. 123 p.

Research output: ThesisPhD Thesis - Research UT, graduation UT

TY - THES

T1 - Copositive Programming and Related Problems

AU - Ahmed, F.

PY - 2014/5/28

Y1 - 2014/5/28

N2 - Foundation of mathematical optimization relies on the urge to utilize available resources to their optimum. This leads to mathematical programs where an objective function is optimized over a set of constraints. The set of constraints can represent different structures, for example, a polyhedron, a box or a cone. Mathematical programs with cone constraints are called cone programs. A sub area of mathematical optimization is the one where the number of variables isfinite while the number of constraints is infinite, known as semi-infinite programming. In the first section of Chapter 1 we will start with a general introduction into the thesis. In the second section some basic definitions are given which are used throughout the thesis. The third and the fourth section provide a brief review of results on cone programming and semi-infinite programming, respectively. In section five we will briefly discuss cone programming relaxations. In the last section we shall give an overview over results presented in the thesis.

AB - Foundation of mathematical optimization relies on the urge to utilize available resources to their optimum. This leads to mathematical programs where an objective function is optimized over a set of constraints. The set of constraints can represent different structures, for example, a polyhedron, a box or a cone. Mathematical programs with cone constraints are called cone programs. A sub area of mathematical optimization is the one where the number of variables isfinite while the number of constraints is infinite, known as semi-infinite programming. In the first section of Chapter 1 we will start with a general introduction into the thesis. In the second section some basic definitions are given which are used throughout the thesis. The third and the fourth section provide a brief review of results on cone programming and semi-infinite programming, respectively. In section five we will briefly discuss cone programming relaxations. In the last section we shall give an overview over results presented in the thesis.

KW - EWI-24809

KW - IR-91101

KW - METIS-303647

U2 - 10.3990/1.9789036536721

DO - 10.3990/1.9789036536721

M3 - PhD Thesis - Research UT, graduation UT

SN - 978-90-365-3672-1

PB - Universiteit Twente

CY - Enschede

ER -