Pages that link to "Item:Q3584167"
From MaRDI portal
The following pages link to Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints (Q3584167):
Displayed 34 items.
- On how to solve large-scale log-determinant optimization problems (Q288409) (← links)
- Quadratic model updating with gyroscopic structure from partial eigendata (Q402225) (← links)
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments (Q429466) (← links)
- Robust least square semidefinite programming with applications (Q457207) (← links)
- Conditional quadratic semidefinite programming: examples and methods (Q489109) (← links)
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems (Q495943) (← links)
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs (Q613430) (← links)
- Newton's method for computing the nearest correlation matrix with a simple upper bound (Q620444) (← links)
- Inexact non-interior continuation method for monotone semidefinite complementarity problems (Q694179) (← links)
- An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
- An inexact SQP Newton method for convex SC\(^{1}\) minimization problems (Q711698) (← links)
- Block relaxation and majorization methods for the nearest correlation matrix with factor structure (Q763394) (← links)
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem (Q1724494) (← links)
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints (Q2026764) (← links)
- A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems (Q2033078) (← links)
- On the linear convergence of the general first order primal-dual algorithm (Q2165808) (← links)
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm (Q2176186) (← links)
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints (Q2181603) (← links)
- A double extrapolation primal-dual algorithm for saddle point problems (Q2211739) (← links)
- A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery (Q2220914) (← links)
- A projected semismooth Newton method for problems of calibrating least squares covariance matrix (Q2275573) (← links)
- Solving a class of matrix minimization problems by linear variational inequality approaches (Q2431152) (← links)
- Optimized projections for compressed sensing via rank-constrained nearest correlation matrix (Q2450944) (← links)
- Limited memory BFGS method for least squares semidefinite programming with banded structure (Q2674941) (← links)
- A global exact penalty for rank-constrained optimization problem and applications (Q2696914) (← links)
- Projection Methods in Conic Optimization (Q2802538) (← links)
- A hybrid splitting method for variational inequality problems with separable structure (Q2867403) (← links)
- Gradient methods and conic least-squares problems (Q3458817) (← links)
- Accelerated method for optimization over density matrices in quantum state estimation (Q4643696) (← links)
- A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices (Q5058396) (← links)
- An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling (Q5092555) (← links)
- Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone (Q5242932) (← links)
- A new alternating projection-based prediction–correction method for structured variational inequalities (Q5379457) (← links)
- Calibrating low-rank correlation matrix problem: an SCA-based approach (Q5746715) (← links)