FR1.R9.2

On the Non-Computability of Convex Optimization Problems

Holger Boche, Andrea Grigorescu, Technical University of Munich, Germany; Rafael F. Schaefer, Technische Universität Dresden, Germany; H. Vincent Poor, Princeton University, United States
Session:
Complexity and Computation Theory 1
Track:
21: Other topics
Location:
Lamda
Presentation Time:
Fri, 12 Jul, 10:05 - 10:25
Session Chair:
Shuki Bruck, California Institute of Technology
Presentation
Not logged in.
Discussion
Not logged in.
Session FR1.R9
FR1.R9.1: Nearest Neighbor Representations of Neural Circuits
Kordag Mehmet Kilic, California Institute of Technology, United States; Jin Sima, University of Illinois Urbana-Champaign, United States; Jehoshua Bruck, California Institute of Technology, United States
FR1.R9.2: On the Non-Computability of Convex Optimization Problems
Holger Boche, Andrea Grigorescu, Technical University of Munich, Germany; Rafael F. Schaefer, Technische Universität Dresden, Germany; H. Vincent Poor, Princeton University, United States
FR1.R9.3: A Mathematical Framework for Computability Aspects of Algorithmic Transparency
Holger Boche, Technical University of Munich, Germany; Adalbert Fono, Gitta Kutyniok, Ludwig-Maximilians-Universität München, Germany
FR1.R9.4: Coded Computing Meets Quantum Circuit Simulation: Coded Parallel Tensor Network Contraction Algorithm
Jin Lee, Zheng Zhang, Haewon Jeong, Sofia Gonzalez-Garcia, University of California, Santa Barbara, United States
Resources
No resources available.