Problems of distance geometry and convex properties of quadratic maps
From MaRDI portal
Publication:1346137
DOI10.1007/BF02574037zbMath0829.05025MaRDI QIDQ1346137
Publication date: 10 January 1996
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131355
Related Items
Exploiting low-rank structure in semidefinite programming by approximate operator splitting, Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems, Bounding duality gap for separable problems with linear constraints, Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems, On Flattenability of Graphs, On bounds of the Pythagoras number of the sum of square magnitudes of Laurent polynomials, An extension of the angular synchronization problem to the heterogeneous setting, An algorithm for realizing Euclidean distance matrices, On the S-procedure and some variants, Measure concentration in optimization, Semidefinite programming in combinatorial optimization, Cuts, matrix completions and graph rigidity, On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations, The spectral bundle method with second-order information, Theory of semidefinite programming for sensor network localization, Unnamed Item, Input design for discrimination between classes of LTI models, SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances, The Pythagoras number of real sum of squares polynomials and sum of square magnitudes of polynomials, A strengthened Barvinok-Pataki bound on SDP rank, Optimality conditions for nonlinear semidefinite programming via squared slack variables, Kalman-Popov-Yakubovich Lemma and the \(S\)-procedure: a historical essay, Constructing uniquely realizable graphs, Exact Recovery with Symmetries for Procrustes Matching, Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs, A penalty decomposition algorithm with greedy improvement for mean‐reverting portfolios with sparsity and volatility constraints, An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs, Distance geometry and data science, An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem, A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming, Solving graph equipartition SDPs on an algebraic variety, Using negative curvature in solving nonlinear programs, Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization, An Epigraphical Approach to the Representer Theorem, Linear Programming on the Stiefel Manifold, Clustering subgaussian mixtures by semidefinite programming, An implementable proximal point algorithmic framework for nuclear norm minimization, The Excluded Minors for Isometric Realizability in the Plane, On the Polyak convexity principle and its application to variational analysis, A new semidefinite programming relaxation scheme for a class of quadratic matrix problems, Moment inequalities for sums of random matrices and their applications in optimization, The generalized trust region subproblem, Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization, A brief introduction to manifold optimization, On the number of realizations of certain Henneberg graphs arising in protein conformation, Elliptic quadratic operator equations, Extreme point inequalities and geometry of the rank sparsity ball, Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment, Memory-Efficient Structured Convex Optimization via Extreme Point Sampling, Unnamed Item, Polynomial diffusions on compact quadric sets, On the Simplicity and Conditioning of Low Rank Semidefinite Programs, An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity, Tightness of the maximum likelihood semidefinite relaxation for angular synchronization, Molecular conformation search by distance matrix perturbations, New results on Hermitian matrix rank-one decomposition, A class of semidefinite programs with rank-one solutions, A survey on conic relaxations of optimal power flow problem, Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints, A convex optimization model for finding non-negative polynomials, Computational Approaches to Max-Cut, Euclidean Distance Matrices and Applications, The trust region subproblem with non-intersecting linear constraints, Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems, On the Burer-Monteiro method for general semidefinite programs, Linear layouts of weakly triangulated graphs, Computational enhancements in low-rank semidefinite programming, On Representer Theorems and Convex Regularization, Diagonally Dominant Programming in Distance Geometry, On convex generalized systems, Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization, Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs, Rank reduction for the local consistency problem, Sequences with minimal time-frequency uncertainty
Cites Work
- Topology of quadratic maps and Hessians of smooth maps
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks
- The Toeplitz-Hausdorff Theorem Explained
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
