On the global convergence of trust region algorithms for unconstrained minimization
From MaRDI portal
Publication:3686437
DOI10.1007/BF02591998zbMath0569.90069OpenAlexW2094879958MaRDI QIDQ3686437
Publication date: 1984
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02591998
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)
Related Items (81)
A nonmonotonic hybrid algorithm for min-max problem ⋮ Conditions for convergence of trust region algorithms for nonsmooth optimization ⋮ A robust descent type algorithm for geophysical inversion through adaptive regularization ⋮ A new trust region method with adaptive radius for unconstrained optimization ⋮ Inexact trust region method for large sparse systems of nonlinear equations ⋮ Descent methods for composite nondifferentiable optimization problems ⋮ A trust region algorithm for minimization of locally Lipschitzian functions ⋮ Superlinearly convergent trust-region method without the assumption of positive-definite Hessian ⋮ Nonmonotone trust region method for solving optimization problems ⋮ A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization ⋮ A two-piece update of projected Hessian algorithm with nonmonotonic trust region method for constrained optimization ⋮ A unified approach to global convergence of trust region methods for nonsmooth optimization ⋮ A new regularized quasi-Newton algorithm for unconstrained optimization ⋮ A new trust region method for nonsmooth nonconvex optimization ⋮ A trust region method for minimization of nonsmooth functions with linear constraints ⋮ The convergence of subspace trust region methods ⋮ A TRUST REGION SUBSPACE METHOD FOR LARGE-SCALE UNCONSTRAINED OPTIMIZATION ⋮ A hybrid algorithm for linearly constrained minimax problems ⋮ Hybrid methods for large sparse nonlinear least squares ⋮ Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations ⋮ A nonmonotone trust region method with adaptive radius for unconstrained optimization problems ⋮ A nonmonotone adaptive trust region method for unconstrained optimization based on conic model ⋮ A new modified nonmonotone adaptive trust region method for unconstrained optimization ⋮ A new restarting adaptive trust-region method for unconstrained optimization ⋮ Nonmonotone adaptive trust region method ⋮ A nonmonotone adaptive trust region method based on conic model for unconstrained optimization ⋮ An efficient nonmonotone trust-region method for unconstrained optimization ⋮ Tikhonov regularization for a general nonlinear constrained optimization problem ⋮ Consistent approximations in composite optimization ⋮ Convergence of a projected gradient method with trust region for nonlinear constrained optimization† ⋮ Combining nonmonotone conic trust region and line search techniques for unconstrained optimization ⋮ A Trust Region Algorithm with Memory for Equality Constrained Optimization ⋮ Nonmonotone algorithm for minimax optimization problems ⋮ Second order necessary and sufficient conditions for convex composite NDO ⋮ A new affine scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality constraints. ⋮ A Newton-Based Method for Nonconvex Optimization with Fast Evasion of Saddle Points ⋮ Second-Order Guarantees of Distributed Gradient Algorithms ⋮ Convergence properties of trust region methods for linear and convex constraints ⋮ Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria ⋮ An adaptive nonmonotone trust-region method with curvilinear search for minimax problem ⋮ Value functions and error bounds of trust region methods ⋮ Global convergence of a nonmonotone trust region algorithm with memory for unconstrained optimization ⋮ A nonmonotone trust-region method of conic model for unconstrained optimization ⋮ On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization ⋮ A trust region SQP algorithm for mixed-integer nonlinear programming ⋮ Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality ⋮ Computation of a trust region step ⋮ A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values ⋮ A new trust region method for unconstrained optimization ⋮ Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations∗ ⋮ Global and local convergence of a nonmonotone trust region algorithm for equality constrained optimization ⋮ A new hybrid method for nonlinear complementarity problems ⋮ A derivative-free trust-region algorithm for composite nonsmooth optimization ⋮ A robust trust region method for nonlinear optimization with inequality constraint ⋮ A hybrid algorithm for nonlinear minimax problems ⋮ Convergence analysis of the Levenberg–Marquardt method ⋮ Trust-region interior-point method for large sparsel1optimization ⋮ A subspace implementation of quasi-Newton trust region methods for unconstrained optimization ⋮ A nonmonotone trust region method for unconstrained optimization problems on Riemannian manifolds ⋮ Respecifying the weighting matrix of a quadratic objective function ⋮ A nonmonotone conic trust region method based on line search for solving unconstrained optimization ⋮ A variant of trust-region methods for unconstrained optimization ⋮ Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods ⋮ Two error bounds for constrained optimization problems and their applications ⋮ A smoothing conic trust region filter method for the nonlinear complementarity problem ⋮ A conic trust-region method and its convergence properties ⋮ COMBINATION ADAPTIVE TRUST REGION METHOD BY NON-MONOTONE STRATEGY FOR UNCONSTRAINED NONLINEAR PROGRAMMING ⋮ A nonmonotone adaptive trust region method and its convergence ⋮ Variable Metric Forward-Backward Algorithm for Composite Minimization Problems ⋮ Unnamed Item ⋮ Impulse noise removal by an adaptive trust-region method ⋮ Efficiency of minimizing compositions of convex functions and smooth maps ⋮ An efficient two-step trust-region algorithm for exactly determined consistent systems of nonlinear equations ⋮ An adaptive approach of conic trust-region method for unconstrained optimization problems ⋮ AN IMPROVED ADAPTIVE TRUST-REGION METHOD FOR UNCONSTRAINED OPTIMIZATION ⋮ Variable metric methods for unconstrained optimization and nonlinear least squares ⋮ Unnamed Item ⋮ A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems ⋮ A wedge trust region method with self-correcting geometry for derivative-free optimization ⋮ An affine scaling interior trust-region method combining with nonmonotone line search filter technique for linear inequality constrained minimization ⋮ A novel Kalman filter formulation for improving tracking performance of the extended kernel RLS
Cites Work
This page was built for publication: On the global convergence of trust region algorithms for unconstrained minimization