scientific article
From MaRDI portal
Publication:3334896
zbMath0545.65047MaRDI QIDQ3334896
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
line searchdescent methodsfunctional minimizationdiscrete nonlinear approximationsuperlinear rate of convergencetrust region techniques
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Related Items (19)
Conditions for convergence of trust region algorithms for nonsmooth optimization ⋮ A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions ⋮ A unified approach to global convergence of trust region methods for nonsmooth optimization ⋮ A new trust region method for nonsmooth nonconvex optimization ⋮ A Gauss-Newton method for convex composite optimization ⋮ A global convergent derivative-free method for solving a system of non-linear equations ⋮ Consistent approximations in composite optimization ⋮ Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function ⋮ Relax-and-split method for nonconvex inverse problems ⋮ Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria ⋮ On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization ⋮ A derivative-free trust-region algorithm for composite nonsmooth optimization ⋮ Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods ⋮ Variable Metric Forward-Backward Algorithm for Composite Minimization Problems ⋮ Efficiency of minimizing compositions of convex functions and smooth maps ⋮ A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems ⋮ Recent advances in trust region algorithms ⋮ Novel approach to accelerating Newton's method for sup-norm optimization arising in \(H^ \infty\)-control ⋮ Nonsmooth bundle trust-region algorithm with applications to robust stability
This page was built for publication:
