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

DOI10.1007/S11766-007-0407-YzbMATH Open1150.90016OpenAlexW2084460316MaRDI QIDQ933072FDOQ933072

Authors: Yan Zhou, Dingguo Pu 

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

Recommendations

• Convergence of QP-free infeasible methods for nonlinear inequality constrained optimization problems
• An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization
• A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
• An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization
• scientific article; zbMATH DE number 2112990

zbMATH Keywords

global convergenceinequality constrained optimization

Mathematics Subject Classification ID

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

Cites Work

• Test examples for nonlinear programming codes
• 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
• Title not available (Why is that?)
• A robust sequential quadratic programming method
• Title not available (Why is that?)
• Inexact generalized Newton methods for second order \(C\)-differentiable optimization

Cited In (3)

• Convergence of QP-free infeasible methods for nonlinear inequality constrained optimization problems
• An inexact smoothing Newton method for nonlinear inequality constrained optimization problems
• Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs

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

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