SDPLR

swMATH4745MaRDI QIDQ16913

No author found.

Described by source

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

Related Items (only showing first 100 items - show all)

Exploiting low-rank structure in semidefinite programming by approximate operator splitting ⋮ Lagrangian Dual Interior-Point Methods for Semidefinite Programs ⋮ Orientation estimation of cryo-EM images using projected gradient descent method ⋮ Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming ⋮ Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems ⋮ Positive Semi-definite Embedding for Dimensionality Reduction and Out-of-Sample Extensions ⋮ Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ Verification, Model Checking, and Abstract Interpretation ⋮ An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence ⋮ Solving PhaseLift by Low-Rank Riemannian Optimization Methods for Complex Semidefinite Constraints ⋮ Computation of Sum of Squares Polynomials from Data Points ⋮ An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations ⋮ Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization ⋮ SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) ⋮ Semidefinite Programming vs. LP Relaxations for Polynomial Programming ⋮ Memory-Efficient Structured Convex Optimization via Extreme Point Sampling ⋮ Fastest Mixing Markov Chain on Graphs with Symmetries ⋮ On the Simplicity and Conditioning of Low Rank Semidefinite Programs ⋮ An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity ⋮ Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems ⋮ The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems ⋮ Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization ⋮ Free Material Optimization with Fundamental Eigenfrequency Constraints ⋮ First-order semidefinite programming for the two-electron treatment of many-electron atoms and molecules ⋮ Iteration-complexity of first-order augmented Lagrangian methods for convex programming ⋮ Worst-case CVaR based portfolio optimization models with applications to scenario planning ⋮ ADMM for multiaffine constrained optimization ⋮ Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices ⋮ Principal Component Analysis by Optimization of Symmetric Functions has no Spurious Local Optima ⋮ An Augmented Primal-Dual Method for Linear Conic Programs ⋮ Nonconvex Robust Low-Rank Matrix Recovery ⋮ A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation ⋮ Solving Lift-and-Project Relaxations of Binary Integer Programs ⋮ Rank Optimality for the Burer--Monteiro Factorization ⋮ Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method ⋮ Adaptive Low-Nonnegative-Rank Approximation for State Aggregation of Markov Chains ⋮ Computational enhancements in low-rank semidefinite programming ⋮ Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably ⋮ On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization ⋮ Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix ⋮ Covariate Regularized Community Detection in Sparse Graphs ⋮ Scalable Semidefinite Programming ⋮ Binary Component Decomposition Part I: The Positive-Semidefinite Case ⋮ Global Registration of Multiple Point Clouds Using Semidefinite Programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion ⋮ Low rank matrix recovery with adversarial sparse noise* ⋮ Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization ⋮ Sums of squares and quadratic persistence on real projective varieties ⋮ A block coordinate descent method for sensor network localization ⋮ Low tubal rank tensor recovery using the Bürer-Monteiro factorisation approach. Application to optical coherence tomography ⋮ Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods ⋮ Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters ⋮ On the tightness of SDP relaxations of QCQPs ⋮ Computing the nearest low-rank correlation matrix by a simplified SQP algorithm ⋮ Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems ⋮ A second-order cone cutting surface method: Complexity and application ⋮ Lifting for Blind Deconvolution in Random Mask Imaging: Identifiability and Convex Relaxation ⋮ Kernel based support vector machine via semidefinite programming: application to medical diagnosis ⋮ On verified numerical computations in convex programming ⋮ Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization ⋮ Implementation of a primal-dual method for SDP on a shared memory parallel architecture ⋮ Relaxation and decomposition methods for mixed integer nonlinear programming. ⋮ A continuation algorithm for max-cut problem ⋮ A boundary point method to solve semidefinite programs ⋮ A note on semidefinite programming relaxations for polynomial optimization over a single sphere ⋮ A trust region method for solving semidefinite programs ⋮ Solving maximum-entropy sampling problems using factored masks ⋮ Semidefinite programming relaxations for graph coloring and maximal clique problems ⋮ Large-scale semidefinite programs in electronic structure calculation ⋮ On the solution of large-scale SDP problems by the modified barrier method using iterative solvers ⋮ Large-scale semidefinite programming via a saddle point mirror-prox algorithm ⋮ Solving large-scale semidefinite programs in parallel ⋮ SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances ⋮ Solving \(k\)-cluster problems to optimality with semidefinite programming ⋮ A strengthened Barvinok-Pataki bound on SDP rank ⋮ Optimality conditions for nonlinear semidefinite programming via squared slack variables ⋮ SDP-based branch-and-bound for non-convex quadratic integer optimization ⋮ Angular synchronization by eigenvectors and semidefinite programming ⋮ Minimizing Condition Number via Convex Programming ⋮ Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs ⋮ Unconstrained formulation of standard quadratic optimization problems ⋮ Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality ⋮ Alternating direction augmented Lagrangian methods for semidefinite programming ⋮ Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming ⋮ An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem ⋮ Using negative curvature in solving nonlinear programs ⋮ First- and second-order methods for semidefinite programming ⋮ An implementable proximal point algorithmic framework for nuclear norm minimization ⋮ A global exact penalty for rank-constrained optimization problem and applications ⋮ A matrix nonconvex relaxation approach to unconstrained binary polynomial programs ⋮ Lower bounds for finding stationary points I ⋮ Two proposals for robust PCA using semidefinite programming ⋮ A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem

This page was built for software: SDPLR