A new penalty-free-type algorithm based on trust region techniques
From MaRDI portal
Publication:387487
DOI10.1016/J.AMC.2012.04.065zbMATH Open1282.90182OpenAlexW2110134798MaRDI QIDQ387487FDOQ387487
Publication date: 23 December 2013
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.04.065
Recommendations
- A penalty-free method for equality constrained optimization
- A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization
- A penalty-free method with superlinear convergence for equality constrained optimization
- Global and local convergence of a penalty-free method for nonlinear programming
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
Cites Work
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Test example for nonlinear programming codes
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
- A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Nonlinear programming without a penalty function.
- Nonlinear programming without a penalty function or a filter
- On the superlinear local convergence of a filter-SQP method
- A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- Global and local convergence of a filter line search method for nonlinear programming
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- A Trust Region Algorithm for Nonlinearly Constrained Optimization
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
Cited In (6)
- A globally convergent penalty-free method for optimization with equality constraints and simple bounds
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming
- A new double trust regions SQP method without a penalty function or a filter
- A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization
- An interior point method for nonlinear optimization with a quasi-tangential subproblem
- A central path interior point method for nonlinear programming and its local convergence
Uses Software
This page was built for publication: A new penalty-free-type algorithm based on trust region techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q387487)
