An SQP method for general nonlinear complementarity problems

DOI10.1007/S11766-000-0041-4MaRDI QIDQ1595262zbMATH OpenOpenAlexFDO

Authors Naihua Xiu

Publication date 25 August 2002

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-000-0041-4

zbMATH Keywords

least squares problemnonlinear complementaritySQP algorithmdamped Gauss-Newton type method

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A nonmonotone feasible SQP method for nonlinear complementarity problems
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• A globally convergent SQP algorithm for mathematical programs with nonlinear complementarity constraints
• A new SQP approach for nonlinear complementarity problems
• An SQP algorithm for mathematical programs with nonlinear complementarity constraints

Cites work

• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• A Newton-type method for positive-semidefinite linear complementarity problems
• A Positive Algorithm for the Nonlinear Complementarity Problem
• A globally convergent Newton method for convex \(SC^ 1\) minimization problems
• An interior point potential reduction method for constrained equations
• Convergence analysis of Gauss-Newton methods for the complementarity problem
• Gauss-Newton methods for the complementarity problem
• Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
• Global Methods for Nonlinear Complementarity Problems
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• Smooth Approximations to Nonlinear Complementarity Problems
• The new advances in methods for complementarity problems.

Cited in

(9)

• scientific article; zbMATH DE number 6263728 (Why is no real title available?)
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• A new SQP approach for nonlinear complementarity problems
• The linear nonnegative least squares problem and its equivalence with the complementarity problem and the fixed point problem
• A nonmonotone feasible SQP method for nonlinear complementarity problems
• scientific article; zbMATH DE number 4081316 (Why is no real title available?)
• Nonnegative least squares solution in inequality sense via LCP reformulation
• On a semismooth least squares formulation of complementarity problems with gap reduction
• A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems

This page was built for publication: An SQP method for general nonlinear complementarity problems

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