A new penalty method for nonlinear programming

DOI10.1016/j.camwa.2006.05.012zbMath1133.90399OpenAlexW2030310352WikidataQ57806818 ScholiaQ57806818MaRDI QIDQ2458508

Yanyan Li

Publication date: 1 November 2007

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2006.05.012

zbMATH Keywords

equality constraintsnonlinear programminginequality constraintsPenalty function methodssemipenalty function method

Mathematics Subject Classification ID

Related Items (5)

An exact penalty function based on the projection matrix ⋮ On the accurate identification of active set for constrained minimax problems ⋮ A line search filter approach for the system of nonlinear equations ⋮ A new SQP approach for nonlinear complementarity problems ⋮ New active set identification for general constrained optimization and minimax problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Penalty functions, Newton's method, and quadratic programming
• Test examples for nonlinear programming codes
• On the convergence of a new trust region algorithm
• On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
• Augmented penalty algorithms

This page was built for publication: A new penalty method for nonlinear programming