A filter-trust-region method for LC 1 unconstrained optimization and its global convergence
From MaRDI portal
Publication:3538600
DOI10.1007/s10496-008-0055-yzbMath1164.65022OpenAlexW2463535218MaRDI QIDQ3538600
Chuangyin Dang, Zhenghao Yang, Wen-Yu Sun
Publication date: 24 November 2008
Published in: Analysis in Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10496-008-0055-y
unconstrained optimizationglobal convergencenonsmooth optimizationtrust region algorithmfilter method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items (7)
A trust-region algorithm combining line search filter method with Lagrange merit function for nonlinear constrained optimization ⋮ An Affine Scaling Interior Trust-Region Algorithm Combining Backtracking Line Search with Filter Technique for Nonlinear Constrained Optimization ⋮ A trust-region algorithm combining line search filter technique for nonlinear constrained optimization ⋮ A non-monotone line search multidimensional filter-SQP method for general nonlinear programming ⋮ Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming ⋮ Local convergence of a trust-region algorithm with line search filter technique for nonlinear constrained optimization ⋮ A dwindling filter line search method for unconstrained optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Newton's method and quasi-Newton-SQP method for general \(\text{LC}^1\) constrained optimization
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- Trust region algorithm for nonsmooth 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
- Nonsmooth Equations: Motivation and Algorithms
- Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
- Optimization and nonsmooth analysis
- Convergence of the BFGS Method for $LC^1 $ Convex Constrained Optimization
- A Globally Convergent Filter Method for Nonlinear Programming
- A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- A Filter-Trust-Region Method for Unconstrained Optimization
- Nonlinear programming without a penalty function.
This page was built for publication: A filter-trust-region method for LC 1 unconstrained optimization and its global convergence