Pages that link to "Item:Q1572667"

The following pages link to Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters. (Q1572667):

Displaying 17 items.

• A globally convergent penalty-free method for optimization with equality constraints and simple bounds (Q267115) (← links)
• Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds (Q852152) (← links)
• A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy (Q864760) (← links)
• Global convergence of slanting filter methods for nonlinear programming (Q932546) (← links)
• A nonmonotone filter trust region method for nonlinear constrained optimization (Q953386) (← links)
• Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization (Q1675558) (← links)
• Global convergence of trust region algorithm for equality and bound constrained nonlinear optimization (Q1812223) (← links)
• A nonmonotone trust-region algorithm with nonmonotone penalty parameters for constrained optimization (Q1883470) (← links)
• Inexact-restoration algorithm for constrained optimization (Q1973486) (← links)
• Global convergence of a new nonmonotone filter method for equality constrained optimization (Q2375740) (← links)
• A trust-region method by active-set strategy for general nonlinear optimization (Q2460581) (← links)
• A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization (Q2489456) (← links)
• Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems (Q2655405) (← links)
• Adaptive augmented Lagrangian methods: algorithms and practical numerical experience (Q2811487) (← links)
• An algorithm for the topology optimization of geometrically nonlinear structures (Q2952527) (← links)
• Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. (Q5958076) (← links)
• A line search exact penalty method with bi-object strategy for nonlinear constrained optimization (Q5964608) (← links)