SDPLR

swMATH4745MaRDI QIDQ16913FDOQ16913

Author name not available (Why is that?)

Described by source

• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

Cited In (only showing first 100 items - show all)

• Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method
• Cutting Plane Generation through Sparse Principal Component Analysis
• Low tubal rank tensor recovery using the Bürer-Monteiro factorisation approach. Application to optical coherence tomography
• A parallel interior point decomposition algorithm for block angular semidefinite programs
• Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method
• Minimizing Condition Number via Convex Programming
• A multilevel analysis of the Lasserre hierarchy
• A block coordinate descent method for sensor network localization
• Sums of squares and quadratic persistence on real projective varieties
• \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
• On verified numerical computations in convex programming
• An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations
• Title not available (Why is that?)
• Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
• Title not available (Why is that?)
• Riemannian preconditioning
• Visualizing network communities with a semi-definite programming method
• Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
• Non-convex exact community recovery in stochastic block model
• On the tightness of SDP relaxations of QCQPs
• A survey on conic relaxations of optimal power flow problem
• Scalable incremental nonconvex optimization approach for phase retrieval
• 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
• An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
• Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
• A brief introduction to manifold optimization
• Adaptive Low-Nonnegative-Rank Approximation for State Aggregation of Markov Chains
• Scalable Semidefinite Programming
• Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold
• Using a factored dual in augmented Lagrangian methods for semidefinite programming
• Optimality conditions for nonlinear semidefinite programming via squared slack variables
• Interior-point algorithms for semidefinite programming based on a nonlinear formulation
• Lower bounds for finding stationary points I
• Lifting for Blind Deconvolution in Random Mask Imaging: Identifiability and Convex Relaxation
• On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization
• Exploiting low-rank structure in semidefinite programming by approximate operator splitting
• A continuation algorithm for max-cut problem
• On the Burer-Monteiro method for general semidefinite programs
• ADMM for multiaffine constrained optimization
• Efficient semidefinite branch-and-cut for MAP-MRF inference
• Using negative curvature in solving nonlinear programs
• A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
• Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
• Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs
• A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix
• Proof methods for robust low-rank matrix recovery
• Title not available (Why is that?)
• Lagrangian Dual Interior-Point Methods for Semidefinite Programs
• A class of semidefinite programs with rank-one solutions
• The State-of-the-Art in Conic Optimization Software
• Solving PhaseLift by Low-Rank Riemannian Optimization Methods for Complex Semidefinite Constraints
• Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization
• Regularization methods for SDP relaxations in large-scale polynomial optimization
• Kernel based support vector machine via semidefinite programming: application to medical diagnosis
• A unifying framework for several cutting plane methods for semidefinite programming
• Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
• An implementable proximal point algorithmic framework for nuclear norm minimization
• Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
• Improved row-by-row method for binary quadratic optimization problems
• Fixed point and Bregman iterative methods for matrix rank minimization
• A second-order cone cutting surface method: Complexity and application
• Semidefinite Programming vs. LP Relaxations for Polynomial Programming
• Alternating direction augmented Lagrangian methods for semidefinite programming
• Algorithms for positive semidefinite factorization
• On semidefinite relaxations for the block model
• A semidefinite programming-based heuristic for graph coloring
• Computational enhancements in low-rank semidefinite programming
• Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
• Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion
• Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
• A boundary point method to solve semidefinite programs
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• First-order semidefinite programming for the two-electron treatment of many-electron atoms and molecules
• Simple algorithms for optimization on Riemannian manifolds with constraints
• Faster, but weaker, relaxations for quadratically constrained quadratic programs
• Computing the nearest low-rank correlation matrix by a simplified SQP algorithm
• Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
• Low-rank factorization for rank minimization with nonconvex regularizers
• Free Material Optimization with Fundamental Eigenfrequency Constraints
• Solving Lift-and-Project Relaxations of Binary Integer Programs
• Iteration-complexity of first-order augmented Lagrangian methods for convex programming
• An Augmented Primal-Dual Method for Linear Conic Programs
• Large-scale semidefinite programs in electronic structure calculation
• SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems
• Worst-case CVaR based portfolio optimization models with applications to scenario planning
• An interior point constraint generation algorithm for semi-infinite optimization with health-care application
• Two proposals for robust PCA using semidefinite programming
• Semidefinite programming relaxations for graph coloring and maximal clique problems
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
• Unconstrained formulation of standard quadratic optimization problems
• Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
• A feasible method for optimization with orthogonality constraints
• Fastest Mixing Markov Chain on Graphs with Symmetries
• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
• Computational Approaches to Max-Cut

This page was built for software: SDPLR