Foundations of Set-Semidefinite Optimization

Gabriele Eichfelder () and Johannes Jahn ()
Additional contact information
Gabriele Eichfelder: Universität Erlangen-Nürnberg
Johannes Jahn: Universität Erlangen-Nürnberg

Chapter Chapter 18 in Nonlinear Analysis and Variational Problems, 2010, pp 259-284 from Springer

Abstract: Abstract In this paper, we present various foundations of a new field of research in optimization unifying semidefinite and copositive programming, which is called set-semidefinite optimization. A set-semidefinite optimization problem is a vector optimization problem with a special constraint defined by a so-called set-semidefinite ordering cone. The investigations of this chapter are based on the paper [11].

Keywords: Convex Cone; Real Hilbert Space; Maximum Clique; Minimal Solution; Vector Optimization Problem (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4419-0158-3_18

Ordering information: This item can be ordered from
http://www.springer.com/9781441901583

DOI: 10.1007/978-1-4419-0158-3_18

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().