A globally convergent penalty-free method for optimization with equality constraints and simple bounds
From MaRDI portal
Publication:267115
DOI10.1007/S10440-015-0013-6zbMATH Open1338.90394OpenAlexW2013812836MaRDI QIDQ267115FDOQ267115
Authors: Songqiang Qiu, Zhongwen Chen 
Publication date: 8 April 2016
Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10440-015-0013-6
Recommendations
- A penalty-free method for equality constrained optimization
- Global and local convergence of a penalty-free method for nonlinear programming
- Nonlinear programming without a penalty function or a filter
- A penalty-free method with superlinear convergence for equality constrained optimization
- A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
nonlinear programmingconstrained optimizationglobal convergencepenalty-free algorithmtrust region method
Cites Work
- Title not available (Why is that?)
- CUTE
- Benchmarking optimization software with performance profiles.
- Trust Region Methods
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- A penalty-function-free line search SQP method for nonlinear programming
- 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 penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization
- A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
- Dynamic Control of Infeasibility in Equality Constrained Optimization
- A new penalty-free-type algorithm based on trust region techniques
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Nonlinear programming without a penalty function.
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming
- Nonlinear programming without a penalty function or a filter
- Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds
Cited In (9)
- Approximate greatest descent methods for optimization with equality constraints
- Global and local convergence of a penalty-free method for nonlinear programming
- An adaptively regularized sequential quadratic programming method for equality constrained optimization
- A penalty-free primal-dual interior-point algorithm and its global convergence
- Title not available (Why is that?)
- A penalty-free method with superlinear convergence for equality constrained optimization
- A penalty-free method for equality constrained optimization
- Convergence of a stabilized SQP method for equality constrained optimization
- Title not available (Why is that?)
Uses Software
This page was built for publication: A globally convergent penalty-free method for optimization with equality constraints and simple bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q267115)
