A trust region filter method for general non-linear programming
From MaRDI portal
Publication:2489398
DOI10.1016/j.amc.2005.03.004zbMath1094.65060OpenAlexW2054110110WikidataQ57806846 ScholiaQ57806846MaRDI QIDQ2489398
Publication date: 28 April 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.03.004
constrained optimizationnonlinear programmingmulti-objectiveMaratos effecttwo trust region filter algorithms
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items
CFD modelling of most probable bubble nucleation rate from binary mixture with estimation of components' mole fraction in critical cluster ⋮ A dwindling filter trust region algorithm for nonlinear optimization ⋮ A new trust region filter algorithm ⋮ Sequential penalty quadratic programming filter methods for nonlinear programming ⋮ A dwindling filter line search algorithm for nonlinear equality constrained optimization ⋮ A filter algorithm for nonlinear systems of equalities and inequalities ⋮ A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization ⋮ A filter method for nonlinear semidefinite programming with global convergence ⋮ A globally and superlinearly convergent modified SQP-filter method ⋮ A dwindling filter inexact projected Hessian algorithm for large scale nonlinear constrained optimization ⋮ A modified filter SQP method as a tool for optimal control of nonlinear systems with spatio-temporal dynamics ⋮ A projection-filter method for solving nonlinear complementarity problems ⋮ A trust region SQP-filter method for nonlinear second-order cone programming ⋮ A new filter-Levenberg-Marquardt method with disturbance for solving nonlinear complementarity problems ⋮ A modified SQP-filter method for nonlinear complementarity problem ⋮ A modified QP-free feasible method ⋮ An SQP-filter method for inequality constrained optimization and its global convergence ⋮ Convergence of a Three-Dimensional Dwindling Filter Algorithm Without Feasibility Restoration Phase ⋮ An infeasible active-set QP-free algorithm for general nonlinear programming ⋮ A modified SQP method with nonmonotone technique and its global convergence
Uses Software
Cites Work
- Unnamed Item
- On a subproblem of trust region algorithms for constrained optimization
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- On the superlinear local convergence of a filter-SQP method
- On the convergence of a new trust region algorithm
- Numerical Optimization
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- Trust Region Methods
- 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.