Piecewise linear NCP function for QP free feasible method

DOI10.1007/S11766-003-0005-6zbMath1160.90618OpenAlexW1523835711MaRDI QIDQ854563

Yan Zhou, Pu, Dingguo

Publication date: 5 December 2006

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

Full work available at URL: https://doi.org/10.1007/s11766-003-0005-6

zbMATH Keywords

convergenceconstrained optimizationnonlinear complementaritysemismooth

Mathematics Subject Classification ID

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

Related Items (1)

Properties and construction of NCP functions

Cites Work

• Unnamed Item
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• Test examples for nonlinear programming codes
• A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• A special newton-type optimization method
• Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
• Engineering and Economic Applications of Complementarity Problems
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations

This page was built for publication: Piecewise linear NCP function for QP free feasible method