Pages that link to "Item:Q1105980"

The following pages link to Computing a nearest symmetric positive semidefinite matrix (Q1105980):

Displaying 50 items.

• Multivariate spatio-temporal models for high-dimensional areal data with application to longitudinal employer-household dynamics (Q262346) (← links)
• Application of the alternating direction method for an inverse monic quadratic eigenvalue problem (Q278291) (← links)
• Douglas-Rachford splitting method for semidefinite programming (Q295495) (← links)
• Anderson acceleration of the alternating projections method for computing the nearest correlation matrix (Q306368) (← links)
• A trust region method for solving semidefinite programs (Q354640) (← links)
• On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
• Parameter identification in financial market models with a feasible point SQP algorithm (Q429503) (← links)
• Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method (Q447558) (← links)
• A constrained matrix least-squares problem in structural dynamics model updating (Q484888) (← links)
• Numerical methods for solving some matrix feasibility problems (Q509640) (← links)
• The matrix pencil nearness problem in structural dynamic model updating (Q525260) (← links)
• Alternating projection method for sparse model updating problems (Q525263) (← links)
• A perturbation approach for an inverse quadratic programming problem (Q607673) (← links)
• The inverse eigenvalue problem of generalized reflexive matrices and its approximation (Q654624) (← links)
• A proximal point-like method for symmetric finite element model updating problems (Q747223) (← links)
• The solvability conditions for the inverse eigenvalue problems of reflexive matrices (Q817477) (← links)
• An iterative method for the symmetric and skew symmetric solutions of a linear matrix equation \(AXB+CYD=E\) (Q848561) (← links)
• The matrix nearness problem for symmetric matrices associated with the matrix equation \([A^{T}XA, B^{T}XB] = [C, D]\) (Q855588) (← links)
• An efficient algorithm for the least-squares reflexive solution of the matrix equation \(A_{1}XB_{1} = C_{1}, A_{2}XB_{2} = C_{2}\) (Q856077) (← links)
• A boundary point method to solve semidefinite programs (Q858180) (← links)
• Matrix iterative solutions to the least squares problem of \(BXA^{T} = F\) with some linear constraints (Q870162) (← links)
• Optimal matrix pencil approximation problem in structural dynamic model updating (Q902808) (← links)
• Alternating direction method for structure-persevering finite element model updating problem (Q907569) (← links)
• The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming (Q927160) (← links)
• An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation (Q942379) (← links)
• Inverse eigenvalue problems of tridiagonal symmetric matrices and tridiagonal bisymmetric matrices (Q945151) (← links)
• Nonsingularity, positive definiteness, and positive invertibility under fixed-point data rounding. (Q954610) (← links)
• An iterative algorithm for the least squares bisymmetric solutions of the matrix equations \(A_{1}XB_{1}=C_{1},A_{2}XB_{2}=C_{2}\) (Q970024) (← links)
• Dynamic system methods for solving mixed linear matrix inequalities and linear vector inequalities and equalities (Q972166) (← links)
• Successive projection iterative method for solving matrix equation \(AX=B\) (Q977417) (← links)
• The general solutions on the minimum residual problem and the matrix nearness problem for symmetric matrices or anti-symmetric matrices (Q990646) (← links)
• The symmetric Procrustes problem (Q1100844) (← links)
• Approximation by matrices positive semidefinite on a subspace (Q1117291) (← links)
• Dykstra's algorithm for constrained least-squares rectangular matrix problems (Q1130433) (← links)
• A numerical procedure for finding the positive definite matrix closest to a patterned matrix (Q1186633) (← links)
• An inverse eigenvalue problem: Computing \(B\)-stable Runge-Kutta methods having real poles (Q1195921) (← links)
• Hybrid methods for solving the educational testing problem (Q1298524) (← links)
• Modifying the inertia of matrices arising in optimization (Q1307208) (← links)
• The matrix sign decomposition and its relation to the polar decomposition (Q1344049) (← links)
• Critical points of matrix least squares distance functions (Q1347216) (← links)
• A projection scheme to stability analysis of discrete T-S fuzzy models. (Q1428714) (← links)
• The least-squares solutions of inconsistent matrix equation over symmetric and antipersymmetric matrices (Q1431916) (← links)
• Least-squares solution for inverse eigenpair problem of nonnegative definite matrices (Q1591963) (← links)
• Least-squares inner product shaping (Q1601627) (← links)
• Numerical low-rank approximation of matrix differential equations (Q1636807) (← links)
• Least-squares solutions of generalized inverse eigenvalue problem over Hermitian-Hamiltonian matrices with a submatrix constraint (Q1655398) (← links)
• Slutsky matrix norms: the size, classification, and comparative statics of bounded rationality (Q1676460) (← links)
• On computing the distance to stability for matrices using linear dissipative Hamiltonian systems (Q1679841) (← links)
• The relaxed-polar mechanism of locally optimal Cosserat rotations for an idealized nanoindentation and comparison with 3D-EBSD experiments (Q1684441) (← links)
• A semi-analytical approach for the positive semidefinite Procrustes problem (Q1688909) (← links)