SDPLR
From MaRDI portal
Cited in
(only showing first 100 items - show all)- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- Blind deconvolution by a steepest descent algorithm on a quotient manifold
- Verification, Model Checking, and Abstract Interpretation
- Adaptive low-nonnegative-rank approximation for state aggregation of Markov chains
- Binary component decomposition. I: The positive-semidefinite case
- The state-of-the-art in conic optimization software
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- Scalable semidefinite programming
- Semidefinite programming relaxations and algebraic optimization in control
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers
- On the landscape of synchronization networks: a perspective from nonconvex optimization
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- The spherical constraint in Boolean quadratic programs
- An augmented Lagrangian approach for sparse principal component analysis
- A global exact penalty for rank-constrained optimization problem and applications
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- Nonconvex Robust Low-Rank Matrix Recovery
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs
- Memory-efficient structured convex optimization via extreme point sampling
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
- First- and second-order methods for semidefinite programming
- Proof methods for robust low-rank matrix recovery
- Probabilistic low-rank matrix completion from quantized measurements
- Principal Component Analysis by Optimization of Symmetric Functions has no Spurious Local Optima
- MQLib
- Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
- scientific article; zbMATH DE number 6135091 (Why is no real title available?)
- Lagrangian Dual Interior-Point Methods for Semidefinite Programs
- 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
This page was built for software: SDPLR
