Search results for "semidefinite"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
79	Andreas Eisenblätter	The Semidefinite Relaxation of the k -Partition Polytope Is Strong.	IPCO	2002	DBLP DOI BibTeX RDF
67	Suely Oliveira, David E. Stewart, Takako Soma	A Subspace Semidefinite Programming for Spectral Graph Partitioning.	International Conference on Computational Science (1)	2002	DBLP DOI BibTeX RDF	semidefinite programming, subspace methods
60	Roland W. Freund, Florian Jarre, Christoph H. Vogelbusch	Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C22, 90C30, 65K05
60	Anthony Man-Cho So, Jiawei Zhang 0006, Yinyu Ye 0001	On approximating complex quadratic optimization problems via semidefinite programming relaxations.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C20, 90C27, 90C22, 90C90
60	Anthony Man-Cho So, Jiawei Zhang 0006, Yinyu Ye 0001	On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations.	IPCO	2005	DBLP DOI BibTeX RDF
57	Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin 0001	A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem.	IPCO	2008	DBLP DOI BibTeX RDF	Branch and cut algorithms, semidefinite programs, polyhedral combinatorics, cutting plane algorithms
57	Janez Povh, Franz Rendl, Angelika Wiegele	A Boundary Point Method to Solve Semidefinite Programs.	Computing	2006	DBLP DOI BibTeX RDF	augmented Lagrangian method, theta function, Semidefinite programming
57	Miguel F. Anjos	An improved semidefinite programming relaxation for the satisfiability problem.	Math. Program.	2005	DBLP DOI BibTeX RDF	Satisfiability, Semidefinite programming, Discrete optimization
57	Dragos M. Cvetkovic, Mirjana Cangalovic, Vera Kovacevic-Vujcic	Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem.	IPCO	1999	DBLP DOI BibTeX RDF	Traveling salesman problem, Semidefinite programming, Branch-and-bound methods
57	Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz	Combining Semidefinite and Polyhedral Relaxations for Integer Programs.	IPCO	1995	DBLP DOI BibTeX RDF	quadratic 0-1 optimization, integer linear programming, semidefinite programming, interior point methods
54	Markus Schweighofer	Describing convex semialgebraic sets by linear matrix inequalities.	ISSAC	2009	DBLP DOI BibTeX RDF	determinantal representation, moment relaxation, polynomial inequality, quadratic module, semialgebraic set, spectrahedron, semidefinite programming, linear matrix inequality, convex set, sums of squares, preordering
54	Kilian Q. Weinberger, Lawrence K. Saul	Unsupervised Learning of Image Manifolds by Semidefinite Programming.	Int. J. Comput. Vis.	2006	DBLP DOI BibTeX RDF	image manifolds, semidefinite embedding, dimensionality reduction, data analysis, kernel methods, semidefinite programming, manifold learning
51	Monique Laurent	Semidefinite representations for finite varieties.	Math. Program.	2007	DBLP DOI BibTeX RDF
51	Kilho Shin, Tetsuji Kuboyama	Polynomial Summaries of Positive Semidefinite Kernels.	ALT	2007	DBLP DOI BibTeX RDF
51	Rajat Mittal 0001, Mario Szegedy	Product Rules in Semidefinite Programming.	FCT	2007	DBLP DOI BibTeX RDF
51	K. A. Ariyawansa, Yuntao Zhu	Stochastic semidefinite programming: a new paradigm for stochastic optimization.	4OR	2006	DBLP DOI BibTeX RDF	MSC Classification 90C15, 90C51, 90C05
51	Kazuhide Nakata, Katsuki Fujisawa, Mituhiro Fukuda	Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results.	Math. Program.	2003	DBLP DOI BibTeX RDF
51	Willem Jan van Hoeve	A Hybrid Constraint Programming and Semidefinite Programming Approach for the Stabe Set Problem.	CP	2003	DBLP DOI BibTeX RDF
50	Frédéric Roupin	From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	K-CLUSTER problem, constrained-memory allocation problem, semidefinite programming, quadratic assignment problem
47	V. Jeyakumar 0001	A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions.	Optim. Lett.	2008	DBLP DOI BibTeX RDF	Semidefinite optimization, Strong duality, Convex programming, Constraint qualifications
47	C. D. Bisbos	Semidefinite optimization models for limit and shakedown analysis problems involving matrix spreads.	Optim. Lett.	2007	DBLP DOI BibTeX RDF	Matrix spread, Mohr-Coulomb criterion, Tresca criterion, Limit analysis, Shakedown analysis, Semidefinite programming
47	Jacek Blaszczyk, Ewa Niewiadomska-Szynkiewicz, Michal Marks	Application of Rectangular Full Packed and Blocked Hybrid Matrix Formats in Semidefinite Programming for Sensor Network Localization.	PPAM	2007	DBLP DOI BibTeX RDF	novel matrix data structures, localization methods, wireless sensor networks, semidefinite programming, Cholesky factorization
47	Pratik Biswas, Tzu-Chen Liang, Ta-Chung Wang, Yinyu Ye 0001	Semidefinite programming based algorithms for sensor network localization.	ACM Trans. Sens. Networks	2006	DBLP DOI BibTeX RDF	distributed methods, Semidefinite programming, sensor network localization
47	Samuel Burer, Renato D. C. Monteiro	Local Minima and Convergence in Low-Rank Semidefinite Programming.	Math. Program.	2005	DBLP DOI BibTeX RDF	Low-rank matrices, Vector programming, Combinatorial optimization, Semidefinite programming, Nonlinear programming, Numerical experiments, Augmented Lagrangian
47	Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui	Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling.	AAIM	2005	DBLP DOI BibTeX RDF	Sports timetabling, Goemans and Williamsons approximation algorithm, semidefinite programming
47	Martin Preiß, Josef Stoer	Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems.	Math. Program.	2004	DBLP DOI BibTeX RDF	infeasible interior-point-paths, semidefinite programming, linear complementarity problems
47	Martin Skutella	Semidefinite Relaxations for Parallel Machine Scheduling.	FOCS	1998	DBLP DOI BibTeX RDF	scheduling, approximation algorithms, randomized algorithms, semidefinite programming, convex programming
47	Anand Srivastav, Katja Wolf	Finding Dense Subgraphs with Semidefinite Programming.	APPROX	1998	DBLP DOI BibTeX RDF	Subgraph Problem, Approximation Algorithms, Randomized Algorithms, Semidefinite Programming
45	Masakazu Kojima, Masakazu Muramatsu	An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones.	Math. Program.	2007	DBLP DOI BibTeX RDF	Polynomial optimization problem, Symmetric cone, Euclidean Jordan algebra, Global optimization, Semidefinite program, Sum of squares, Conic program
45	Pablo A. Parrilo	Sums of squares of polynomials and their applications.	ISSAC	2004	DBLP DOI BibTeX RDF	semidefinite programming, convex optimization, multivariate polynomials, sum of squares
44	Sanjeev Mahajan, Ramesh Hariharan	Derandomizing Semidefinite Programming Based Approximation Algorithms.	FOCS	1995	DBLP DOI BibTeX RDF	semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat
44	David R. Karger, Rajeev Motwani 0001, Madhu Sudan 0001	Approximate Graph Coloring by Semidefinite Programming	FOCS	1994	DBLP DOI BibTeX RDF	approximate graph coloring, k-colorable graphs, randomized polynomial time algorithm, semidefinite optimization problems, MAX 2-SAT problems, duality relationship, lower bounds, linear programs, semidefinite programming, vertices, chromatic number, MAX CUT, approximation ratio
41	Hossein Mansouri, Cornelis Roos	A new full-Newton step O(n) infeasible interior-point algorithm for semidefinite optimization.	Numer. Algorithms	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 90C05, 90C51
41	Troy Lee, Rajat Mittal 0001	Product Theorems Via Semidefinite Programming.	ICALP (1)	2008	DBLP DOI BibTeX RDF
41	Bao Liu, Sheldon X.-D. Tan	Minimum Decoupling Capacitor Insertion in VLSI Power/Ground Supply Networks by Semidefinite and Linear Programs.	IEEE Trans. Very Large Scale Integr. Syst.	2007	DBLP DOI BibTeX RDF
41	Monique Laurent	Strengthened semidefinite programming bounds for codes.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C27, 90C22, 94B65, 05E20
41	Miguel F. Anjos	An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs.	Ann. Math. Artif. Intell.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 90C22, 03B05, 90C09, 90C90, 68T15
41	Dimitris Bertsimas, Constantine Caramanis	Bounds on linear PDEs via semidefinite optimization.	Math. Program.	2006	DBLP DOI BibTeX RDF
41	Ilse Fischer, Gerald Gruber, Franz Rendl, Renata Sotirov	Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C22, 90C27
41	Garud Iyengar, David J. Phillips, Clifford Stein 0001	Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring.	IPCO	2005	DBLP DOI BibTeX RDF
41	Uriel Feige, Michael Langberg	The RPR2 Rounding Technique for Semidefinite Programs.	ICALP	2001	DBLP DOI BibTeX RDF
41	Uriel Feige, Gideon Schechtman	On the integrality ratio of semidefinite relaxations of MAX CUT.	STOC	2001	DBLP DOI BibTeX RDF
41	David R. Karger, Rajeev Motwani 0001, Madhu Sudan 0001	Approximate Graph Coloring by Semidefinite Programming.	J. ACM	1998	DBLP DOI BibTeX RDF	approximation algorithms, NP-completeness, randomized algorithms, graph coloring, chromatic number
41	Philip N. Klein, Hsueh-I Lu	Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs.	ISAAC	1998	DBLP DOI BibTeX RDF
41	Thomas Hofmeister, Martin Hühne	Semidefinite Programming and Its Applications to Approximation Algorithms.	Lectures on Proof Verification and Approximation Algorithms	1997	DBLP DOI BibTeX RDF
38	Takayuki Osogami, Rudy Raymond	Semidefinite optimization for transient analysis of queues.	SIGMETRICS	2010	DBLP DOI BibTeX RDF	occupation measure, semidefinite programming, duality, bounds, moments, transient, g/g/1 queue
38	Bo Xiao, Xiaokang Yang, Yi Xu 0001, Hongyuan Zha	Learning distance metric for regression by semidefinite programming with application to human age estimation.	ACM Multimedia	2009	DBLP DOI BibTeX RDF	human age estimation, kNN regression, semidefinite programming, metric learning
38	Hayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu, Hiroshi Sugimoto	Algorithm 883: SparsePOP - A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems.	ACM Trans. Math. Softw.	2008	DBLP DOI BibTeX RDF	Matlab software package, polynomial optimization problem, semidefinite programming relaxation, sums-of-squares optimization, Global optimization, sparsity
38	Steven J. Benson, Yinyu Ye 0001	Algorithm 875: DSDP5 - software for semidefinite programming.	ACM Trans. Math. Softw.	2008	DBLP DOI BibTeX RDF	dual-scaling algorithm, Semidefinite programming, linear matrix inequalities, interior-point methods, conic programming
38	Samuel Burer, Dieter Vandenbussche	A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations.	Math. Program.	2008	DBLP DOI BibTeX RDF	Nonconcave quadratic maximization, Nonconvex quadratic programming, Lift-and-project relaxations, Branch-and-bound, Semidefinite programming
38	Adam N. Letchford, Michael Malmros Sørensen	Binary Positive Semidefinite Matrices and Associated Integer Polytopes.	IPCO	2008	DBLP DOI BibTeX RDF	semidefinite programming, Polyhedral combinatorics
38	Sanjeev Arora, Satyen Kale	A combinatorial, primal-dual approach to semidefinite programs.	STOC	2007	DBLP DOI BibTeX RDF	balanced separator, matrix multiplicative weights, min UnCut, semidefinite programming, sparsest cut
38	Umar Malik, Imad M. Jaimoukha, G. D. Halikias, S. K. Gungah	On the gap between the quadratic integer programming problem and its semidefinite relaxation.	Math. Program.	2006	DBLP DOI BibTeX RDF	Quadratic integer programming, Semidefinite relaxation, Zonotopes, Linear matrix inequalities, Hyperplane arrangements
38	Masakazu Muramatsu	A Unified Class of Directly Solvable Semidefinite Programming Problems.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	directly solvable SDP, the simplest SDP, semidefinite programming
38	Guanglu Zhou, Kim-Chuan Toh	Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming.	Math. Program.	2004	DBLP DOI BibTeX RDF	infeasible interior point method, inexact search direction, semidefinite programming, primal-dual, polynomial complexity
38	Hongwei Liu 0001, Sanyang Liu, Fengmin Xu	A Tight Semidefinite Relaxation of the MAX CUT Problem.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	semidefinite relaxation, cut polytope, metric polytope, MAX CUT problem
35	Prasad Raghavendra	Optimal algorithms and inapproximability results for every CSP?	STOC	2008	DBLP DOI BibTeX RDF	dictatorship tests, rounding schemes, semidefinite programming, constraint satisfaction problem, unique games conjecture
35	Kurt M. Anstreicher	The volumetric barrier for convex quadratic constraints.	Math. Program.	2004	DBLP DOI BibTeX RDF	Volumetric barrier, Convex quadratic constraints, Semidefinite programming
35	Eran Halperin, Aravind Srinivasan	Improved Approximation Algorithms for the Partial Vertex Cover Problem.	APPROX	2002	DBLP DOI BibTeX RDF	Partial vertex cover, approximation algorithms, semidefinite programming, randomized rounding
31	J. William Helton, Jiawang Nie	Semidefinite representation of convex sets.	Math. Program.	2010	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 46N10, 47N10, 90C25, 65K05, 90C22
31	Franz Rendl, Giovanni Rinaldi, Angelika Wiegele	Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations.	Math. Program.	2010	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C20, 90C27, 90C22
31	Kenneth Wing-Kin Lui, Frankie K. W. Chan, Hing-Cheung So	Semidefinite Programming Approach for Range-Difference Based Source Localization.	IEEE Trans. Signal Process.	2009	DBLP DOI BibTeX RDF
31	Yuhong Guo	Max-margin Multiple-Instance Learning via Semidefinite Programming.	ACML	2009	DBLP DOI BibTeX RDF
31	Jean B. Lasserre, Monique Laurent, Philipp Rostalski	Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals.	Found. Comput. Math.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 14P05, 12E12, 12D10, 90C22, 13P10
31	Ingo Mierswa, Katharina Morik	About the non-convex optimization problem induced by non-positive semidefinite kernel learning.	Adv. Data Anal. Classif.	2008	DBLP DOI BibTeX RDF	JEL Classification C45, C14
31	Joakim Jaldén, Björn E. Ottersten	The Diversity Order of the Semidefinite Relaxation Detector.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
31	Chek Beng Chua	Analyticity of weighted central paths and error bounds for semidefinite programming.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C22, 90C25, 90C51
31	Defeng Sun, Jie Sun 0001, Liwei Zhang	The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C22, 65K05, 49J52
31	Etienne de Klerk, Dmitrii V. Pasechnik, Alexander Schrijver	Reduction of symmetric semidefinite programs using the regular *-representation.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C22, 20B40, 05C10
31	Madhu V. Nayakkankuppam	Solving large-scale semidefinite programs in parallel.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C22, 90C06, 65F15, 65Y05
31	Zhaosong Lu, Arkadi Nemirovski, Renato D. C. Monteiro	Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C22, 90C25, 90C51, 65K10
31	Igor Dukanovic, Franz Rendl	Semidefinite programming relaxations for graph coloring and maximal clique problems.	Math. Program.	2007	DBLP DOI BibTeX RDF	Lovász theta number, Clique number, Cutting planes, Chromatic number
31	Nebojsa Gvozdenovic, Monique Laurent	Semidefinite bounds for the stability number of a graph via sums of squares of polynomials.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C69, 90C27, 90C22
31	Xinwei Li, Hui Jiang 0001	Solving Large-Margin Hidden Markov Model Estimation via Semidefinite Programming.	IEEE Trans. Speech Audio Process.	2007	DBLP DOI BibTeX RDF
31	Franz Rendl, Giovanni Rinaldi, Angelika Wiegele	A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations.	IPCO	2007	DBLP DOI BibTeX RDF
31	Alexandre d'Aspremont, Laurent El Ghaoui	A Semidefinite Relaxation for Air Traffic Flow Scheduling.	RIVF	2007	DBLP DOI BibTeX RDF
31	Chunhua Shen, Hongdong Li, Michael J. Brooks	Feature Extraction Using Sequential Semidefinite Programming.	DICTA	2007	DBLP DOI BibTeX RDF
31	Zhiping Lin 0001, Yongzhi Liu	FIR filter design with group delay constraint using semidefinite programming.	ISCAS	2006	DBLP DOI BibTeX RDF
31	Jens Keuchel	Multiclass Image Labeling with Semidefinite Programming.	ECCV (2)	2006	DBLP DOI BibTeX RDF
31	Chee-Khian Sim, Gongyun Zhao	A note on treating a second order cone program as a special case of a semidefinite program.	Math. Program.	2005	DBLP DOI BibTeX RDF
31	Nebojsa Gvozdenovic, Monique Laurent	Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials.	IPCO	2005	DBLP DOI BibTeX RDF
31	Alain Faye, Frédéric Roupin	A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem.	ESA	2005	DBLP DOI BibTeX RDF
31	Patrick Cousot	Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming.	VMCAI	2005	DBLP DOI BibTeX RDF
31	Alantha Newman	Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
31	Samuel Burer, Renato D. C. Monteiro	A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization.	Math. Program.	2003	DBLP DOI BibTeX RDF
31	Pablo A. Parrilo	Semidefinite programming relaxations for semialgebraic problems.	Math. Program.	2003	DBLP DOI BibTeX RDF
31	Xin Chen, Paul Tseng	Non-Interior continuation methods for solving semidefinite complementarity problems.	Math. Program.	2003	DBLP DOI BibTeX RDF
31	Suely Oliveira, David E. Stewart, Takako Soma	Semidefinite Programmingfor Graph Partitioning with Preferencesin Data Distribution.	VECPAR	2002	DBLP DOI BibTeX RDF
31	Thore Graepel	Kernel Matrix Completion by Semidefinite Programming.	ICANN	2002	DBLP DOI BibTeX RDF
31	Garud Iyengar, Mehmet Tolga Çezik	Cutting Planes for Mixed 0-1 Semidefinite Programs.	IPCO	2001	DBLP DOI BibTeX RDF
31	Michel X. Goemans	Using Complex Semidefinite Programming for Approximating MAX E2-LIN3.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
31	Michel X. Goemans, David P. Williamson	Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming.	STOC	2001	DBLP DOI BibTeX RDF
31	Uri Zwick	Semidefinite Programming Based Approximation Algorithms.	FSTTCS	2001	DBLP DOI BibTeX RDF
31	Katsuki Fujisawa, Yukinobu Hamuro, Naoki Katoh, Takeshi Tokuyama, Katsutoshi Yada	Approximation of Optimal Two-Dimensional Association Rules for Categorical Attributes Using Semidefinite Programming.	Discovery Science	1999	DBLP DOI BibTeX RDF
29	Linli Xu, Dana F. Wilkinson, Finnegan Southey, Dale Schuurmans	Discriminative unsupervised learning of structured predictors.	ICML	2006	DBLP DOI BibTeX RDF
29	Etienne de Klerk, Dmitrii V. Pasechnik, Joost P. Warners	On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	semidefiniteprogramming, Lovász -function, MAX-k-CUT, approximation algorithms, satisfiability, graph colouring
29	Christoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl	Incorporating Inequality Constraints in the Spectral Bundle Method.	IPCO	1998	DBLP DOI BibTeX RDF
29	Howard J. Karloff, Uri Zwick	A 7/8-Approximation Algorithm for MAX 3SAT?	FOCS	1997	DBLP DOI BibTeX RDF
28	Enyang Xu, Zhi Ding 0001, Soura Dasgupta	Reduced Complexity Semidefinite Relaxation Algorithms for Source Localization Based on Time Difference of Arrival.	IEEE Trans. Mob. Comput.	2011	DBLP DOI BibTeX RDF	time difference of arrival, semidefinite programming, Source localization
28	Alexander Shapiro 0001	Semidefinite Programming: Optimality Conditions and Stability.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Tangent cone, Complementarity condition, Stability, Sensitivity analysis, Semidefinite programming, Duality, Lagrange multipliers, Nondegeneracy