Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
From MaRDI portal
Publication:3584167
DOI10.1137/080727075zbMath1201.49031OpenAlexW2145505545MaRDI QIDQ3584167
Publication date: 19 August 2010
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/62440a9e574aeb50c8be676dd9c75eded4c44b48
Convex programming (90C25) Nonlinear programming (90C30) Numerical methods involving duality (49M29) Newton-type methods (49M15)
Related Items
On how to solve large-scale log-determinant optimization problems ⋮ A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices ⋮ Gradient methods and conic least-squares problems ⋮ On the linear convergence of the general first order primal-dual algorithm ⋮ Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm ⋮ An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling ⋮ Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints ⋮ A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs ⋮ Limited memory BFGS method for least squares semidefinite programming with banded structure ⋮ Quadratic model updating with gyroscopic structure from partial eigendata ⋮ Newton's method for computing the nearest correlation matrix with a simple upper bound ⋮ Solving a class of matrix minimization problems by linear variational inequality approaches ⋮ Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments ⋮ A global exact penalty for rank-constrained optimization problem and applications ⋮ A double extrapolation primal-dual algorithm for saddle point problems ⋮ Robust least square semidefinite programming with applications ⋮ A new alternating projection-based prediction–correction method for structured variational inequalities ⋮ A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery ⋮ Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem ⋮ Optimized projections for compressed sensing via rank-constrained nearest correlation matrix ⋮ Conditional quadratic semidefinite programming: examples and methods ⋮ A partial proximal point algorithm for nuclear norm regularized matrix least squares problems ⋮ Accelerated method for optimization over density matrices in quantum state estimation ⋮ Inexact non-interior continuation method for monotone semidefinite complementarity problems ⋮ An inexact spectral bundle method for convex quadratic semidefinite programming ⋮ Calibrating low-rank correlation matrix problem: an SCA-based approach ⋮ An inexact SQP Newton method for convex SC\(^{1}\) minimization problems ⋮ A projected semismooth Newton method for problems of calibrating least squares covariance matrix ⋮ An accelerated active-set algorithm for a quadratic semidefinite program with general constraints ⋮ A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems ⋮ Projection Methods in Conic Optimization ⋮ Block relaxation and majorization methods for the nearest correlation matrix with factor structure ⋮ Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone ⋮ A hybrid splitting method for variational inequality problems with separable structure
Uses Software
