scientific article
From MaRDI portal
Publication:3932225
zbMath0476.65048MaRDI QIDQ3932225
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
rate of convergencenonlinear programmingnondifferentiable optimizationsuccessive quadratic programmingtrust region
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Numerical methods based on nonlinear programming (49M37)
Related Items (18)
A nonmonotonic hybrid algorithm for min-max problem ⋮ Conditions for convergence of trust region algorithms for nonsmooth optimization ⋮ A Trust-region Method for Nonsmooth Nonconvex Optimization ⋮ A trust region algorithm for nonsmooth optimization ⋮ An analysis of reduced Hessian methods for constrained optimization ⋮ Delamination of composites as a substationarity problem: Numerical approximation and algorithms ⋮ Unnamed Item ⋮ Nonmonotone algorithm for minimax optimization problems ⋮ Nonlinear robust optimization via sequential convex bilevel programming ⋮ Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems ⋮ A trust region SQP algorithm for mixed-integer nonlinear programming ⋮ An adaptively regularized sequential quadratic programming method for equality constrained optimization ⋮ Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions ⋮ Newton-type methods: a broader view ⋮ A derivative-free trust-region algorithm for composite nonsmooth optimization ⋮ An inexact algorithm for composite nondifferentiable optimization ⋮ On the numerical modeling of convex particle assemblies with friction ⋮ A globally convergent algorithm for nonlinearly constrained optimization problems
This page was built for publication:
