On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization

DOI10.1007/S10107-014-0794-9zbMath1319.90065OpenAlexW2043409612MaRDI QIDQ494338

Jin Yun Yuan, Ya-Xiang Yuan, Geovani Nunes Grapiglia

Publication date: 31 August 2015

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-014-0794-9

zbMATH Keywords

unconstrained optimizationglobal convergencemultiobjective optimizationregularization methodsworst-case complexitytrust-region methodscomposite nonsmooth optimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37)

Related Items (40)

An adaptive trust-region method without function evaluations ⋮ On high-order model regularization for multiobjective optimization ⋮ Concise complexity analyses for trust region methods ⋮ Global complexity bound of the inexact Levenberg-Marquardt method ⋮ Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models ⋮ Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization ⋮ On the use of third-order models with fourth-order regularization for unconstrained optimization ⋮ Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization ⋮ An adaptive regularization method in Banach spaces ⋮ Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization ⋮ Inexact restoration with subsampled trust-region methods for finite-sum minimization ⋮ Adaptive trust-region method on Riemannian manifold ⋮ On the worst-case evaluation complexity of non-monotone line search algorithms ⋮ On the complexity of a stochastic Levenberg-Marquardt method ⋮ Convergence rates analysis of a multiobjective proximal gradient method ⋮ On High-order Model Regularization for Constrained Optimization ⋮ A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares ⋮ Implementable tensor methods in unconstrained convex optimization ⋮ ARC_q: a new adaptive regularization by cubics ⋮ On Regularization and Active-set Methods with Complexity for Constrained Optimization ⋮ Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality ⋮ Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models ⋮ Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization ⋮ A derivative-free trust-region algorithm for composite nonsmooth optimization ⋮ Regional complexity analysis of algorithms for nonconvex smooth optimization ⋮ A brief survey of methods for solving nonlinear least-squares problems ⋮ Worst-case complexity bounds of directional direct-search methods for multiobjective optimization ⋮ Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization ⋮ A generalized worst-case complexity analysis for non-monotone line searches ⋮ Complexity of gradient descent for multiobjective optimization ⋮ Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models ⋮ On the Complexity of an Inexact Restoration Method for Constrained Optimization ⋮ Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization ⋮ On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization ⋮ Global complexity bound of the Levenberg–Marquardt method ⋮ Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact ⋮ Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary ⋮ On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization ⋮ Recent advances in trust region algorithms ⋮ The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
• Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
• Convergence rate of the trust region method for nonlinear equations under local error bound condition
• Steepest descent methods for multicriteria optimization.
• A new trust region method for nonlinear equations
• A trust-region method for unconstrained multiobjective problems with applications in satisficing processes
• Optimization theory and methods. Nonlinear programming
• Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares
• On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
• Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
• On the global convergence of trust region algorithms for unconstrained minimization
• A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
• Conditions for convergence of trust region algorithms for nonsmooth optimization
• On the superlinear convergence of a trust region algorithm for nonsmooth optimization
• A model algorithm for composite nondifferentiable optimization problems
• Trust Region Methods
• Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization
• Modified Gauss–Newton scheme with worst case guarantees for global performance
• Optimality conditions for \(C^{1,1}\) vector optimization problems

This page was built for publication: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization