„Semidefinite Programming“

Suchergebnisse

299 Treffer

• Exposed Faces of Semidefinitely Representable Sets
  Netzer, Tim ; Plaumann, Daniel ; Schweighofer, Markus 2011 Bibliothek der Universität Konstanz
• An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
  Yang, Heng ; Liang, Ling ; Carlone, Luca ; Toh, Kim-Chuan
• A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
  Yamakawa, Yuya ; Okuno, Takayuki
• Sparse Recovery Under Side Constraints Using Null Space Properties
  Matter, Frederic 2022 Verlag Dr. Hut
• Sparse Recovery Under Side Constraints Using Null Space Properties
  Matter, Frederic 2022 Dr. Hut
• A simplified treatment of Ramana’s exact dual for semidefinite programming
  Lourenço, Bruno F. ; Pataki, Gábor
• A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics
  Padovani, Cristina ; Porcelli, Margherita
• Limited Memory BFGS Method for Least Squares Semidefinite Programming with Banded Structure
  Xue, Wenjuan ; Shen, Chungen ; Yu, Zhensheng
• DC Semidefinite programming and cone constrained DC optimization I: theory
  Dolgopolik, M. V.
• Primal–Dual Newton Method with Steepest Descent for the Linear Semidefinite Programming Problem: Iterative Process
  Zhadan, V. G.
• An Inexact Proximal DC Algorithm with Sieving Strategy for Rank Constrained Least Squares Semidefinite Programming
  Ding, Mingcai ; Song, Xiaoliang ; Yu, Bo
• A Line Search SQP-type Method with Bi-object Strategy for Nonlinear Semidefinite Programming
  Fu, Wen-hao ; Chen, Zhong-wen
• A characterization of the algebraic degree in semidefinite programming
  Hiep, Dang Tuan ; Giao, Nguyen Thi Ngoc ; Van, Nguyen Thi Mai
• Primal–Dual Newton Method with Steepest Descent for the Linear Semidefinite Programming Problem: Newton’s System of Equations
  Zhadan, V. G.
• A paradox in bosonic energy computations via semidefinite programming relaxations
  Navascues, M. ; Garcia-Saez, A. ; Acin, A. ; Pironio, S. ; Plenio, Martin B. 2013 Universität Ulm
• Efficient Semidefinite Programming with Approximate ADMM
  Rontsis, Nikitas ; Goulart, Paul ; Nakatsukasa, Yuji
• Bregman primal–dual first-order method and application to sparse semidefinite programming
  Jiang, Xin ; Vandenberghe, Lieven
• Convex quadratic and semidefinite programming relaxations in Scheduling
  Skutella, Martin
• A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion
  Bellavia, Stefania ; Gondzio, Jacek ; Porcelli, Margherita
• $${\cal U}{\cal V}$$ U V -theory of a Class of Semidefinite Programming and Its Applications
  Huang, Ming ; Yuan, Jin-long ; Pang, Li-ping ; Xia, Zun-quan