A line search filter-SQP method with Lagrangian function for nonlinear inequality constrained optimization
DOI10.1007/S13160-017-0236-1zbMATH Open1370.49031OpenAlexW2587469071MaRDI QIDQ2364355FDOQ2364355
Authors: Lili Pang, Detong Zhu 
Publication date: 19 July 2017
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-017-0236-1
Recommendations
- A globally convergent line search filter SQP method for inequality constrained optimization
- A line search filter inexact SQP method for nonlinear equality constrained optimization
- A global convergent line search filter SQP method
- A modified SQP method with nonmonotone line search technique without a penalty or a filter for nonlinear inequality constrained optimization
- An SQP-filter method for inequality constrained optimization and its global convergence
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- Templates for convex cone problems with applications to sparse signal recovery
- Numerical Optimization
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Trust Region Methods
- 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.
- Test examples for nonlinear programming codes
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- On the superlinear local convergence of a filter-SQP method
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- Global and local convergence of a filter line search method for nonlinear programming
- Global convergence of a tri-dimensional filter SQP algorithm based on the line search method
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- A filter method with unified step computation for nonlinear optimization
- A nonmonotone filter method for nonlinear optimization
- A semismooth Newton method with multidimensional filter globalization for \(l_1\)-optimization
- A Globally Convergent Filter Method for Nonlinear Programming
- A Sequential Linear Constraint Programming Algorithm for NLP
Cited In (5)
- A line search SQP method without a penalty or a filter
- A global convergent line search filter SQP method
- A new adaptive method to nonlinear semi-infinite programming
- A line search filter inexact SQP method for nonlinear equality constrained optimization
- Filter trust region method for nonlinear semi-infinite programming problem
Uses Software
This page was built for publication: A line search filter-SQP method with Lagrangian function for nonlinear inequality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364355)
