A smoothing QP-free infeasible method for nonlinear inequality constrained optimization

DOI10.1007/S11766-007-0407-YzbMath1150.90016OpenAlexW2084460316MaRDI QIDQ933072

Yan Zhou, Pu, Dingguo

Publication date: 6 August 2008

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

Full work available at URL: https://doi.org/10.1007/s11766-007-0407-y

zbMATH Keywords

global convergenceinequality constrained optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Cites Work

• Unnamed Item
• Unnamed Item
• Test examples for nonlinear programming codes
• Inexact generalized Newton methods for second order \(C\)-differentiable optimization
• A robust sequential quadratic programming method
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• Exact penalty function algorithm with simple updating of the penalty parameter
• 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

This page was built for publication: A smoothing QP-free infeasible method for nonlinear inequality constrained optimization