A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results
From MaRDI portal
Publication:5058375
DOI10.1080/10556788.2021.1913155OpenAlexW3154895586MaRDI QIDQ5058375
Hani Ahmadzadeh, Nezam Mahdavi-Amiri
Publication date: 20 December 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2021.1913155
global convergencefilternonmonotone algorithmsuccessive quadratic programming (SQP)inexact SQP methodsuperlinear local convergence\(\ell_1\)-exact penalty function
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Methods of successive quadratic programming type (90C55) Numerical methods for variational inequalities and related problems (65K15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A line search exact penalty method using steering rules
- A nonmonotone filter method for nonlinear optimization
- An inexact Newton method for nonconvex equality constrained optimization
- A nonmonotone filter trust region method for nonlinear constrained optimization
- A globally convergent method for nonlinear programming
- Solving mixed integer nonlinear programs by outer approximation
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
- On the superlinear local convergence of a filter-SQP method
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Multiplier and gradient methods
- Sequential Quadratic Programming Methods
- An Inexact Sequential Quadratic Optimization Algorithm for Nonlinear Optimization
- A robust combined trust region–line search exact penalty projected structured scheme for constrained nonlinear least squares
- A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Algorithms for PDE-constrained optimization
- A Second Derivative SQP Method: Global Convergence
- A Second Derivative SQP Method: Local Convergence and Practical Issues
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- A Truncated SQP Method Based on Inexact Interior-Point Solutions of Subproblems
- A Sequential Quadratic Optimization Algorithm with Rapid Infeasibility Detection
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Optimization Methods in Finance
- Steering exact penalty methods for nonlinear programming
- An Inexact SQP Method for Equality Constrained Optimization
- Practical Methods for Optimal Control and Estimation Using Nonlinear Programming
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- A Trust Region Algorithm for Nonlinearly Constrained Optimization
- Exact penalty functions in nonlinear programming
- Inexact Newton Methods
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Trust Region Methods
- On the Global Convergence of a Filter--SQP Algorithm
- Interior Methods for Nonlinear Optimization
- A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem
- Nonlinear Programming
- A Filter Method with Unified Step Computation for Nonlinear Optimization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Benchmarking optimization software with performance profiles.
- Nonlinear programming without a penalty function.
