Globally convergent algorithms for semidefinite complementarity problems
type: Item
instance of: scholarly article
zbMATH Open document ID: 1049.90102
author: Yanlian Lai
author: Liping Zhang
author: Ziyou Gao
publication date: 2001-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 1719478
zbMATH Keywords: merit function
MaRDI profile type: Publication
Recommended article: A Global Algorithm for Nonlinear Semidefinite Programming
Recommended article: A globally convergent method for semi-infinite linear programming
Recommended article: OPTIMIZATION BASED GLOBALLY CONVERGENT METHODS FOR THE NONLINEAR COMPLEMENTARITY PROBLEM
Recommended article: Globally convergent algorithms for solving unconstrained optimization problems
Recommended article: Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
Recommended article: Global Methods for Nonlinear Complementarity Problems
Recommended article: A globally convergent algorithm for nonlinearly constrained optimization problems
Recommended article: Q4941759
Recommended article: The semismooth algorithm for large scale complementarity problems
Recommended article: Optimality conditions and global convergence for nonlinear semidefinite programming
title: Globally convergent algorithms for semidefinite complementarity problems
published in: Journal of Systems Science and Mathematical Sciences
description: scientific article; zbMATH DE number 1719478