Pages that link to "Item:Q493442"

The following pages link to Global and local convergence of a penalty-free method for nonlinear programming (Q493442):

Displaying 10 items.

• A globally convergent penalty-free method for optimization with equality constraints and simple bounds (Q267115) (← links)
• Local convergence analysis of proximal Gauss-Newton method for penalized nonlinear least squares problems (Q279318) (← links)
• A new penalty-free-type algorithm based on trust region techniques (Q387487) (← links)
• Global and local convergence of a class of penalty-free-type methods for nonlinear programming (Q693410) (← links)
• On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming (Q738946) (← links)
• A line search penalty-free method for nonlinear second-order cone programming (Q829562) (← links)
• Global convergence of a new method for minimax problem without a penalty function or a filter (Q2918824) (← links)
• An exact penalty function method with global convergence properties for nonlinear programming problems (Q3768690) (← links)
• (Q3812052) (← links)
• A line search exact penalty method with bi-object strategy for nonlinear constrained optimization (Q5964608) (← links)