A line search SQP method without a penalty or a filter
From MaRDI portal
Publication:2516801
DOI10.1007/s40314-014-0137-8zbMath1317.90278OpenAlexW1985698727MaRDI QIDQ2516801
Publication date: 4 August 2015
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-014-0137-8
Related Items
A new filter QP-free method for the nonlinear inequality constrained optimization problem, Sequential quadratic programming method for nonlinear least squares estimation and its application
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A nonmonotone filter method for nonlinear optimization
- Nonlinear programming without a penalty function or a filter
- Test examples for nonlinear programming codes
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- On the superlinear local convergence of a filter-SQP method
- 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 Globally Convergent Filter Method for Nonlinear Programming
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Global and local convergence of a filter line search method for nonlinear programming
- Benchmarking optimization software with performance profiles.
- Nonlinear programming without a penalty function.
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
