A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization

DOI10.1016/j.amc.2005.04.031zbMath1093.65058OpenAlexW2029682968MaRDI QIDQ2489456

Yanyan Li

Publication date: 28 April 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.04.031

zbMATH Keywords

numerical examplesnonlinear programmingGlobal convergenceNonmonotonePenalty-free-typeTrust-region method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items (11)

A globally convergent penalty-free method for optimization with equality constraints and simple bounds ⋮ Global convergence of a new nonmonotone filter method for equality constrained optimization ⋮ An Affine Scaling Interior Trust-Region Algorithm Combining Backtracking Line Search with Filter Technique for Nonlinear Constrained Optimization ⋮ A new penalty-free-type algorithm based on trust region techniques ⋮ A penalty-free method with superlinear convergence for equality constrained optimization ⋮ An improved nonmonotone filter trust region method for equality constrained optimization ⋮ Global convergence of a nonmonotone filter method for equality constrained optimization ⋮ Penalty-free method for nonsmooth constrained optimization via radial basis functions ⋮ A nonmonotone filter trust region method for nonlinear constrained optimization ⋮ Global and local convergence of a class of penalty-free-type methods for nonlinear programming ⋮ A penalty-free method with line search for nonlinear equality constrained optimization

Uses Software

• TRICE

Cites Work

• Unnamed Item
• Unnamed Item
• The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
• More test examples for nonlinear programming codes
• Test examples for nonlinear programming codes
• A trust region algorithm for equality constrained optimization
• Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
• Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.
• A globally convergent trust region algorithm for optimization with general constraints and simple bounds.
• A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation
• A Trust Region Algorithm for Nonlinearly Constrained Optimization
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
• A Trust Region Method for Nonlinear Programming Based on Primal Interior-Point Techniques
• On the Convergence Theory of Trust-Region-Based Algorithms for Equality-Constrained Optimization
• A Global Convergence Theory for Dennis, El-Alem, and Maciel's Class of Trust-Region Algorithms for Constrained Optimization without Assuming Regularity
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
• On Perturbations in Systems of Linear Inequalities
• A trust region method based on interior point techniques for nonlinear programming.
• Nonlinear programming without a penalty function.

This page was built for publication: A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization