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

DOI10.1016/j.laa.2010.11.041zbMath1213.65089OpenAlexW1999088134MaRDI QIDQ2431152

Min Tao, Xiao-Ming Yuan, Bing-sheng 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

variational inequalitiesnumerical examplesLevenberg-Marquardt methodprojection and contraction methodmatrix minimization

Mathematics Subject Classification ID

Related Items (3)

A homotopy alternating direction method of multipliers for linearly constrained separable convex optimization ⋮ Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization ⋮ Projection and contraction method for updating simultaneously mass and stiffness matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving a class of linear projection equations
• A new method for a class of linear variational inequalities
• Inexact implicit methods for monotone general variational inequalities
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
• An alternating projections method for certain linear problems in a Hilbert space
• On the basic theorem of complementarity

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