„Semidefinite Programming“

Suchergebnisse

299 Treffer

• Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
  Kanno, Yoshihiro
• Integer Programming and Combinatorial Optimization – 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings
  Louveaux, Quentin ; Skutella, Martin 2016 Springer International Publishing
• Switching Graph Matrix Norm Bounds: From i.i.d. to Random Regular Graphs
  Xu, Jeff 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Geometric Methods and Applications – For Computer Science and Engineering
  2001 Springer New York
• Semidefinite games
  Ickstadt, Constantin ; Theobald, Thorsten ; Tsigaridas, Elias 2024 Universitätsbibliothek Johann Christian Senckenberg
• Robust Static Super-Replication of Barrier Options
  Maruhn, Jan H. 2009 De Gruyter
• Characterizations of the Aubin property of the solution mapping for nonlinear semidefinite programming
  Chen, Liang ; Chen, Ruoning ; Sun, Defeng ; Zhang, Liping
• Semidefinite programming for manipulating acoustic traps in real time (SMART)
  Zehnter, Sebastian ; Endres, Kevin ; Kronbichler, Martin ; Andrade, Marco A. B. ; Funke, Felix ; Ament, Christoph 2025 Universität Augsburg
• Proximal-stabilized semidefinite programming
  Cipolla, Stefano ; Gondzio, Jacek
• Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem
  Bhattiprolu, Vijay ; Lee, Euiwoong ; Tulsiani, Madhur 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fidelity of Quantum Strategies with Applications to Cryptography
  Gutoski, Gus ; Rosmanis, Ansis ; Sikora, Jamie 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Simple, Near-Optimal Quantum Protocols for Die-Rolling
  Sikora, Jamie 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Linear, Semidefinite Programming and Randomization Methods for Combinatorial Optimization Problems (Dagstuhl Seminar 00041)
  Jansen, Klaus ; Rolim, Jose ; Sudan, Madhu 2000 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On Measuring Average Case Complexity via Sum-Of-Squares Degree (Invited Talk)
  Raghavendra, Prasad 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Improved Approximation Algorithm for the Max-3-Section Problem
  Katzelnick, Dor ; Pillai, Aditya ; Schwartz, Roy ; Singh, Mohit 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
  Roberson, David ; Seppelt, Tim 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Ellipsoid Fitting up to a Constant
  Hsieh, Jun-Ting ; Kothari, Pravesh K. ; Potechin, Aaron ; Xu, Jeff 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm
  Hsieh, Jun-Ting ; Kothari, Pravesh K. 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Truss topology design under harmonic loads: peak power minimization with semidefinite programming
  Ma, Shenyuan ; Mareček, Jakub ; Kungurtsev, Vyacheslav ; Tyburec, Marek
• An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut
  Mirka, Renee ; Williamson, David P. 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik