SDPLR
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm
- A class of semidefinite programs with rank-one solutions
- Global registration of multiple point clouds using semidefinite programming
- scientific article; zbMATH DE number 6860781 (Why is no real title available?)
- An optimal-storage approach to semidefinite programming using approximate complementarity
- Regularization methods for SDP relaxations in large-scale polynomial optimization
- Solving PhaseLift by Low-Rank Riemannian Optimization Methods for Complex Semidefinite Constraints
- Kernel based support vector machine via semidefinite programming: application to medical diagnosis
- An implementable proximal point algorithmic framework for nuclear norm minimization
- A unifying framework for several cutting plane methods for semidefinite programming
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- Low tubal rank tensor recovery using the Bürer-Monteiro factorisation approach. Application to optical coherence tomography
- Improved row-by-row method for binary quadratic optimization problems
- Fixed point and Bregman iterative methods for matrix rank minimization
- Maximum a posteriori inference of random dot product graphs via conic programming
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- A second-order cone cutting surface method: Complexity and application
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Lifting for blind deconvolution in random mask imaging: identifiability and convex relaxation
- Minimizing Condition Number via Convex Programming
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- A multilevel analysis of the Lasserre hierarchy
- Algorithms for positive semidefinite factorization
- Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- A block coordinate descent method for sensor network localization
- Sums of squares and quadratic persistence on real projective varieties
- On semidefinite relaxations for the block model
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
- On verified numerical computations in convex programming
- A semidefinite programming-based heuristic for graph coloring
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
- Fastest mixing Markov chain on graphs with symmetries
- Computational enhancements in low-rank semidefinite programming
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
- Covariate regularized community detection in sparse graphs
- scientific article; zbMATH DE number 2246591 (Why is no real title available?)
- Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
- Low-rank optimization on the cone of positive semidefinite matrices
- A boundary point method to solve semidefinite programs
- Computation of sum of squares polynomials from data points
- Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization
- Riemannian preconditioning
- Visualizing network communities with a semi-definite programming method
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- Computing the nearest low-rank correlation matrix by a simplified SQP algorithm
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- Simple algorithms for optimization on Riemannian manifolds with constraints
- First-order semidefinite programming for the two-electron treatment of many-electron atoms and molecules
- Non-convex exact community recovery in stochastic block model
- Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
- On the tightness of SDP relaxations of QCQPs
- A survey on conic relaxations of optimal power flow problem
- Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
- Scalable incremental nonconvex optimization approach for phase retrieval
- Low-rank factorization for rank minimization with nonconvex regularizers
- A convex relaxation to compute the nearest structured rank deficient matrix
- A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al.
- Solving maximum-entropy sampling problems using factored masks
- Solving large-scale semidefinite programs in parallel
- Computational approaches to MAX-cut
- On the simplicity and conditioning of low rank semidefinite programs
- Free Material Optimization with Fundamental Eigenfrequency Constraints
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- Exact worst-case performance of first-order methods for composite convex optimization
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Large-scale semidefinite programs in electronic structure calculation
- A brief introduction to manifold optimization
- Scalable low-rank semidefinite programming for certifiably correct machine perception
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
- An Augmented Primal-Dual Method for Linear Conic Programs
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming
- Using a factored dual in augmented Lagrangian methods for semidefinite programming
- SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Optimality conditions for nonlinear semidefinite programming via squared slack variables
- Orientation estimation of cryo-EM images using projected gradient descent method
- Interior-point algorithms for semidefinite programming based on a nonlinear formulation
- Lower bounds for finding stationary points I
- An interior point constraint generation algorithm for semi-infinite optimization with health-care application
- Improved performance guarantees for orthogonal group synchronization via generalized power method
- Cutting plane generation through sparse principal component analysis
- CSDP
- SDPLIB
- LFTB
- SDPA
- SeDuMi
- SDPT3
- DSDP5
- PENNON
- SDPpack
- Benchmarks for Optimization Software
- CirCut
- COL
- DSPCA
- QSDP
- SMCP
- SDLS
This page was built for software: SDPLR
