EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"semidefinite relaxations"
Narrow search

Narrow search

Year of publication
Subject
All
Semidefinite relaxations 4 Polynomial optimization 3 Mathematical programming 2 Mathematische Optimierung 2 Robust optimization 2 Theorie 2 Theory 2 0/1 Programs 1 Benders decomposition 1 LP- and semidefinite relaxations 1 Lebesgue and Gaussian measures 1 Linear and quadratic 0/1 programs 1 MAX-CUT problem 1 Min-max optimization 1 Min–max optimization 1 Portfolio optimization 1 Positivstellensatz 1 Sum of squares 1 convex optimization 1 moment problem and sums of squares 1 semialgebraic sets 1 semidefinite relaxations 1
more ... less ...
Online availability
All
Undetermined 4 Free 1
Type of publication
All
Article 5 Book / Working Paper 1
Type of publication (narrower categories)
All
Article in journal 2 Aufsatz in Zeitschrift 2
Language
All
English 3 Undetermined 3
Author
All
Lasserre, J. 2 Emin, Youssouf 1 Kleniati, P. M. 1 Lasserre, Jean 1 Lasserre, Jean B. 1 Lasserre, Jean-Bernard 1 Parpas, Panos 1 Rustem, Berc 1 Thanh, Tung 1
more ... less ...
Institution
All
COMISEF 1
Published in...
All
Journal of Global Optimization 2 Mathematics of operations research 1 Operations research letters 1 TOP: An Official Journal of the Spanish Society of Statistics and Operations Research 1 Working Papers / COMISEF 1
Source
All
RePEc 4 ECONIS (ZBW) 2
Showing 1 - 6 of 6
Cover Image
Semidefinite relaxations for Lebesgue and Gaussian measures of unions of basic semialgebraic sets
Lasserre, Jean-Bernard; Emin, Youssouf - In: Mathematics of operations research 44 (2019) 4, pp. 1477-1493
Persistent link: https://www.econbiz.de/10012128385
Saved in:
Cover Image
A MAX-CUT formulation of 0/1 programs
Lasserre, Jean B. - In: Operations research letters 44 (2016) 2, pp. 158-164
Persistent link: https://www.econbiz.de/10011457255
Saved in:
Cover Image
Partitioning Procedure for Polynomial Optimization: Application to Portfolio Decisions with Higher Order Moments
Kleniati, P. M.; Parpas, Panos; Rustem, Berc - COMISEF - 2009
We consider the problem of finding the minimum of a real-valued multivariate polynomial function constrained in a compact set defined by polynomial inequalities and equalities. This problem, called polynomial optimization problem (POP), is generally nonconvex and has been of growing interest to...
Persistent link: https://www.econbiz.de/10008491699
Saved in:
Cover Image
A “joint + marginal” heuristic for 0/1 programs
Lasserre, Jean; Thanh, Tung - In: Journal of Global Optimization 54 (2012) 4, pp. 729-744
hierarchy of what we call “joint + marginal” semidefinite relaxations whose duals provide a sequence of polynomial …
Persistent link: https://www.econbiz.de/10010994030
Saved in:
Cover Image
An algorithm for semi-infinite polynomial optimization
Lasserre, J. - In: TOP: An Official Journal of the Spanish Society of … 20 (2012) 1, pp. 119-129
Persistent link: https://www.econbiz.de/10010557939
Saved in:
Cover Image
Min-max and robust polynomial optimization
Lasserre, J. - In: Journal of Global Optimization 51 (2011) 1, pp. 1-10
Persistent link: https://www.econbiz.de/10009324653
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...