„semidefinite programming“

Suchergebnisse

299 Treffer

• Derivation of the Lewenstein–Sanpera Decomposition via Semidefinite Programming
  Jafarizadeh, M. A. ; Mirzaee, M. ; Rezaee, M.
• T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
  Marumo, Hiroki ; Kim, Sunyoung ; Yamashita, Makoto
• On semidefinite programming and applications in combinatorial optimization
  Gruber, Gerald 2000 Shaker
• Image partitioning based on semidefinite programming
  Keuchel, Jens
• A semidefinite programming approach for robust elliptic localization
  Xiong, Wenxin ; Chen, Yuming ; He, Jiajun ; Shi, Zhang-Lei ; Hu, Keyuan ; So, Hing Cheung ; Leung, Chi-Sing 2024 Universität
• A new distributionally robust reward-risk model for portfolio optimization
  Zhou, Yijia ; Xu, Lijun
• Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming
  Klerk, Etienne ˜deœ ; Roos, C. ; Terlaky, T.
• Control of stochastic hybrid systems based on probabilistic reachable set computation
  Asselborn, Leonhard 2018 Kassel University Press
• Complete quadrics : Schubert calculus for Gaussian models and semidefinite programming
  Manivel, Laurent ; Michałek, Mateusz ; Monin, Leonid ; Seynnaeve, Tim ; Vodicka, Martin 2023 KOPS Universität Konstanz
• A Semidefinite Programming Heuristic for Quadratic Programming Problems with Complementarity Constraints
  Braun, Stephen ; Mitchell, John E.
• IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming
  Zhang, Rui-Jin ; Liu, Xin-Wei ; Dai, Yu-Hong
• From H ∞ Control to Multiobjective Control: An Overview (Von der H ∞ -Regelung zur Mehrziel-Regelung: ein Überblick)
  Rieber, Jochen M. ; Allgöwer, Frank
• Global optimization of rational functions: a semidefinite programming approach
  Jibetean, D. ; de Klerk, E.
• A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
  Monteiro, Renato DC ; Zhang, Yin
• From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems
  Roupin, Frédéric
• Sparse non Gaussian component analysis by semidefinite programming
  Diederichs, Elmar ; Juditsky, Anatoli ; Nemirovskij, Arkadij S. ; Spokojnyj, Vladimir G.
• Adaptive grid semidefinite programming for finding optimal designs
  Duarte, Belmiro P. M. ; Wong, Weng Kee ; Dette, Holger
• Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares
  Gaar, Elisabeth ; Krenn, Daniel ; Margulies, Susan ; Wiegele, Angelika 2021 Universität Augsburg
• On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems
  Sun, Xiangkai ; Huang, Jiayi ; Teo, Kok Lay
• A Unified Class of Directly Solvable Semidefinite Programming Problems
  Muramatsu, Masakazu