Globally convergent algorithms for semidefinite complementarity problems

MaRDI QIDQ2778197zbMATH OpenFDO

Authors Yanlian Lai, Liping Zhang, Ziyou Gao

Publication date 2001

Published in Journal of Systems Science and Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

merit function

Mathematics Subject Classification ID

Semidefinite programming (90C22) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A Global Algorithm for Nonlinear Semidefinite Programming
• A globally convergent method for semi-infinite linear programming
• OPTIMIZATION BASED GLOBALLY CONVERGENT METHODS FOR THE NONLINEAR COMPLEMENTARITY PROBLEM
• Globally convergent algorithms for solving unconstrained optimization problems
• Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
• Global Methods for Nonlinear Complementarity Problems
• A globally convergent algorithm for nonlinearly constrained optimization problems
• scientific article; zbMATH DE number 1414198
• The semismooth algorithm for large scale complementarity problems
• Optimality conditions and global convergence for nonlinear semidefinite programming

Cited in

(2)

• A Global Algorithm for Nonlinear Semidefinite Programming
• A global \(\mathbb{R}\)-linear convergence algorithm for the generalized linear complementarity problem over a closed convex cone

This page was built for publication: Globally convergent algorithms for semidefinite complementarity problems

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