Solving a class of matrix minimization problems by linear variational inequality approaches

DOI10.1016/J.LAA.2010.11.041MaRDI QIDQ2431152zbMATH OpenOpenAlexFDO

Authors Min Tao, Xiaoming Yuan, Bingsheng He

Publication date 11 April 2011

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2010.11.041

zbMATH Keywords

Levenberg-Marquardt methodmatrix minimizationnumerical examplesprojection and contraction methodvariational inequalities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical methods for variational inequalities and related problems (65K15) Quadratic programming (90C20)

Recommendations

• A new method for a class of linear variational inequalities
• A class of linear constrained matrix inequality and its least squares problem
• scientific article; zbMATH DE number 1383431
• Solving linear variational inequality problems by a self-adaptive projection method
• scientific article; zbMATH DE number 2143826

Cites work

• A new method for a class of linear variational inequalities
• An alternating projections method for certain linear problems in a Hilbert space
• Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 844464 (Why is no real title available?)
• scientific article; zbMATH DE number 1437529 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Inexact implicit methods for monotone general variational inequalities
• On the basic theorem of complementarity
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Solving a class of linear projection equations
• The Numerical Solution of Parabolic and Elliptic Differential Equations

Cited in

(9)

• A homotopy alternating direction method of multipliers for linearly constrained separable convex optimization
• Projection and contraction method for updating simultaneously mass and stiffness matrices
• Matrix corrections minimal with respect to the Euclidean norm for linear programming problems
• Determinant Maximization with Linear Matrix Inequality Constraints
• Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method
• scientific article; zbMATH DE number 2143826 (Why is no real title available?)
• scientific article; zbMATH DE number 5051712 (Why is no real title available?)
• Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
• Finding the strongly rank-minimizing solution to the linear matrix inequality

This page was built for publication: Solving a class of matrix minimization problems by linear variational inequality approaches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431152)