scientific article; zbMATH DE number 7626745
From MaRDI portal
Publication:5053241
Lucie Neirac, Guillaume Lecué, Stéphane Chrétien, Mihai Cucuringu
Publication date: 6 December 2022
Full work available at URL: https://arxiv.org/abs/2004.01869
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp nonasymptotic bounds on the norm of random matrices with independent entries
- A mathematical introduction to compressive sensing
- Guaranteed clustering and biclustering via semidefinite programming
- Stable optimizationless recovery from phaseless linear measurements
- Reconstruction and estimation in the planted partition model
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Angular synchronization by eigenvectors and semidefinite programming
- Handbook on semidefinite, conic and polynomial optimization
- Community detection in sparse networks via Grothendieck's inequality
- Weighted minimum trace factor analysis
- Using the eigenvalue relaxation for binary least-squares estimation problems
- Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
- Rates of convergence for minimum contrast estimators
- Problems of distance geometry and convex properties of quadratic maps
- Semidefinite programming in combinatorial optimization
- Quadratic maximization and semidefinite relaxation
- Smooth discrimination analysis
- Approximate optimal designs for multivariate polynomial regression
- Optimal aggregation of classifiers in statistical learning.
- Weak convergence and empirical processes. With applications to statistics
- New variants of bundle methods
- An extension of the angular synchronization problem to the heterogeneous setting
- Robust statistical learning with Lipschitz and convex loss functions
- Optimal rates for community estimation in the weighted stochastic block model
- Mean estimation with sub-Gaussian rates in polynomial time
- Partial recovery bounds for clustering with the relaxed \(K\)-means
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- Local minima and convergence in low-rank semidefinite programming
- Empirical minimization
- Phase recovery, MaxCut and complex semidefinite programming
- Bounds for the least Laplacian eigenvalue of a signed graph
- Riemannian Trust Regions with Finite-Difference Hessian Approximations are Globally Convergent
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Manopt, a Matlab toolbox for optimization on manifolds
- Phase transitions in semidefinite relaxations
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
- Exact Recovery in the Stochastic Block Model
- Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
- Multireference alignment using semidefinite programming
- Three-Dimensional Structure Determination from Common Lines in Cryo-EM by Eigenvectors and Semidefinite Programming
- Statistical mechanics of complex networks
- Approximation Algorithms and Semidefinite Programming
- Approximate Kernel Clustering
- Semidefinite optimization
- The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
- Semidefinite Relaxations for Integer Programming
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- Communities in Networks
- Decomposition through formalization in a product space
- Approximate graph coloring by semidefinite programming
- A Nonlinear Programming Problem in Statistics (Educational Testing)
- On the Shannon capacity of a graph
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- Linear Matrix Inequalities in System and Control Theory
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Exponential Error Rates of SDP for Block Models: Beyond Grothendieck’s Inequality
- High-Dimensional Probability
- Synchronization overZ2and community detection in signed multiplex networks with constraints
- Semidefinite Optimization and Convex Algebraic Geometry
- Scalable Semidefinite Programming
- Positive Semi-definite Embedding for Dimensionality Reduction and Out-of-Sample Extensions
- Denoising modulo samples: k-NN regression and tightness of SDP relaxation
- Achieving the Bayes Error Rate in Synchronization and Block Models by SDP, Robustly
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
- Fast unfolding of communities in large networks
- A useful variant of the Davis–Kahan theorem for statisticians
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Learning Theory and Kernel Machines
- Singular vectors under random perturbation
- Grothendieck’s Theorem, past and present
- Approximating K‐means‐type Clustering via Semidefinite Programming
- First-order semidefinite programming for the two-electron treatment of many-electron atoms and molecules
- Complex Quadratic Optimization and Semidefinite Programming
- The Rotation of Eigenvectors by a Perturbation. III
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Optimization via low-rank approximation for community detection in networks
This page was built for publication:
