Find link

language:

Find link is a tool written by Edward Betts.

searching for Semidefinite programming 29 found (105 total)

alternate case: semidefinite programming

Jiří Matoušek (mathematician) (904 words) [view diff] case mismatch in snippet view article

Society, 2010, ISBN 978-0-8218-4977-4. Approximation Algorithms and Semidefinite Programming (with B. Gärtner). Springer Berlin Heidelberg, 2012, ISBN 978-3-642-22014-2

Kissing number (2,204 words) [view diff] exact match in snippet view article find links to article

Mittelmann, Hans D.; Vallentin, Frank (2010). "High accuracy semidefinite programming bounds for kissing numbers". Experimental Mathematics. 19 (2):

Defeng Sun (633 words) [view diff] exact match in snippet view article find links to article

question of characterizing the strong regularity of nonlinear semidefinite programming (SDP) problems. Sun was awarded the triennial 2018 Beale-Orchard-Hays

Barbier's theorem (669 words) [view diff] exact match in snippet view article find links to article

doi:10.1007/BF02413320. Bayen, Térence; Henrion, Didier (2012), "Semidefinite programming for optimizing convex bodies under width constraints", Optimization

Finite element limit analysis (370 words) [view diff] exact match in snippet view article find links to article

finite elements limit analysis for Hoek-Brown materials using semidefinite programming." Journal of Engineering Mechanics 143.9 (2017): 04017077.doi:10

Quantum Fisher information (4,474 words) [view diff] exact match in snippet view article find links to article

bounds on it, based on some given operator expectation values using semidefinite programming. The approach considers an optimizaton on the two-copy space. There

Katya Scheinberg (569 words) [view diff] case mismatch in snippet view article find links to article

dissertation, Issues Related to Interior Point Methods for Linear and Semidefinite Programming, was supervised by Donald Goldfarb. Scheinberg worked for IBM Research

N-ellipse (452 words) [view diff] case mismatch in snippet view article find links to article

Papers of James Clerk Maxwell: 1846-1862 P.L. Rosin: "On the Construction of Ovals" B. Sturmfels: "The Geometry of Semidefinite Programming", pp. 9–16.

Graph product (610 words) [view diff] exact match in snippet view article find links to article

doi:10.1016/j.jctb.2015.12.009. Bačík, R.; Mahajan, S. (1995). "Semidefinite programming and its applications to NP problems". Computing and Combinatorics

Nonlinear dimensionality reduction (6,112 words) [view diff] exact match in snippet view article find links to article

technique for casting this problem as a semidefinite programming problem. Unfortunately, semidefinite programming solvers have a high computational cost

Gram matrix (3,167 words) [view diff] exact match in snippet view article find links to article

L. E.; Jordan, M. I. (2004). "Learning the kernel matrix with semidefinite programming". Journal of Machine Learning Research. 5: 27–72 [p. 29]. Horn

Multiple kernel learning (2,856 words) [view diff] exact match in snippet view article find links to article

Ghaoui, and Michael I. Jordan. Learning the kernel matrix with semidefinite programming. Journal of Machine Learning Research, 5:27–72, 2004a Gert R. G

Symposium on Geometry Processing (267 words) [view diff] case mismatch in snippet view article find links to article

2013 Qixing Huang and Leonidas Guibas Consistent Shape Maps via Semidefinite Programming Simon Giraudot et al. Noise-Adaptive Shape Reconstruction from

Tamás Terlaky (1,595 words) [view diff] exact match in snippet view article find links to article

Etienne; Roos, Cornelis; Terlaky, Tamás (1997) “Initialization in semidefinite programming via a self-dual skew-symmetric embedding” Operations Research Letters

Normalized Google distance (1,181 words) [view diff] case mismatch in snippet view article find links to article

Zeugmann (2006). Clustering the Google Distance with Eigenvectors and Semidefinite Programming (PDF). Knowledge Media Technologies, First International Core-to-Core

Principal component analysis (14,851 words) [view diff] exact match in snippet view article find links to article

proposed, including a regression framework, a convex relaxation/semidefinite programming framework, a generalized power method framework an alternating

Locality-sensitive hashing (4,024 words) [view diff] exact match in snippet view article find links to article

approximation algorithms for maximum cut and satisfiability problems using semidefinite programming". Journal of the ACM. 42 (6). Association for Computing Machinery

Distance geometry (3,316 words) [view diff] exact match in snippet view article find links to article

Wiley & Sons. Biswas, P.; Lian, T.; Wang, T.; Ye, Y. (2006). "Semidefinite programming based algorithms for sensor network localization". ACM Transactions

Leroy P. Steele Prize (2,239 words) [view diff] case mismatch in snippet view article find links to article

Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming," (published in 1995 in the Journal of the ACM). 2021 Murray Gerstenhaber

Information theory (7,976 words) [view diff] case mismatch in snippet view article find links to article

(January 2018). "LQG Control With Minimum Directed Information: Semidefinite Programming Approach". IEEE Transactions on Automatic Control. 63 (1): 37–52

Low-rank approximation (3,884 words) [view diff] exact match in snippet view article find links to article

applications, including to recover a good solution from an inexact (semidefinite programming) relaxation. If additional constraint g ( p ^ ) ≤ 0 {\displaystyle

Directed information (3,106 words) [view diff] case mismatch in snippet view article find links to article

(January 2018). "LQG Control With Minimum Directed Information: Semidefinite Programming Approach". IEEE Transactions on Automatic Control. 63 (1): 37–52

Binary search (9,657 words) [view diff] exact match in snippet view article find links to article

(2007). "Quantum algorithms for the ordered search problem via semidefinite programming". Physical Review A. 75 (3). 032335. arXiv:quant-ph/0608161. Bibcode:2007PhRvA

Cholesky decomposition (8,335 words) [view diff] case mismatch in snippet view article find links to article

IEEE. pp. 70–72. arXiv:1111.4144. So, Anthony Man-Cho (2007). A Semidefinite Programming Approach to the Graph Realization Problem: Theory, Applications

L1-norm principal component analysis (2,336 words) [view diff] exact match in snippet view article find links to article

Michael; Tropp, Joel A. (2011). "Two proposals for robust PCA using semidefinite programming". Electronic Journal of Statistics. 5: 1123–1160. arXiv:1012.1086

Quadratic knapsack problem (3,911 words) [view diff] exact match in snippet view article find links to article

(1996). "Quadratic knapsack relaxations using cutting planes and semidefinite programming". Integer Programming and Combinatorial Optimization. Lecture Notes

Glossary of graph theory (16,011 words) [view diff] exact match in snippet view article find links to article

and chromatic number that can be computed in polynomial time by semidefinite programming. Thomsen graph The Thomsen graph is a name for the complete bipartite

Kalman filter (20,726 words) [view diff] exact match in snippet view article find links to article

(2009). "Estimation of the disturbance structure from data using semidefinite programming and optimal weighting". Automatica. 45 (1): 142–148. doi:10.1016/j

Pseudo-range multilateration (9,850 words) [view diff] exact match in snippet view article find links to article

solutions of time difference of arrival source localization based on semidefinite programming and Lagrange multiplier: complexity and performance analysis,"