Pages that link to "Item:Q494338"
From MaRDI portal
The following pages link to On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization (Q494338):
Displaying 42 items.
- Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality (Q504812) (← links)
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (Q526842) (← links)
- Concise complexity analyses for trust region methods (Q1634776) (← links)
- Global complexity bound of the inexact Levenberg-Marquardt method (Q1656193) (← links)
- Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization (Q1675558) (← links)
- On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392) (← links)
- A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares (Q1715713) (← links)
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208) (← links)
- A derivative-free trust-region algorithm for composite nonsmooth optimization (Q2013620) (← links)
- Regional complexity analysis of algorithms for nonconvex smooth optimization (Q2020615) (← links)
- Worst-case complexity bounds of directional direct-search methods for multiobjective optimization (Q2026717) (← links)
- A generalized worst-case complexity analysis for non-monotone line searches (Q2028039) (← links)
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
- An adaptive trust-region method without function evaluations (Q2125064) (← links)
- On the use of third-order models with fourth-order regularization for unconstrained optimization (Q2182770) (← links)
- Inexact restoration with subsampled trust-region methods for finite-sum minimization (Q2191786) (← links)
- Implementable tensor methods in unconstrained convex optimization (Q2227532) (← links)
- A brief survey of methods for solving nonlinear least-squares problems (Q2273095) (← links)
- Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization (Q2301133) (← links)
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
- Recent advances in trust region algorithms (Q2349124) (← links)
- Convergence rates analysis of a multiobjective proximal gradient method (Q2688916) (← links)
- Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models (Q2802144) (← links)
- On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization (Q2815548) (← links)
- Global complexity bound of the Levenberg–Marquardt method (Q2829563) (← links)
- On High-order Model Regularization for Constrained Optimization (Q4602340) (← links)
- ARC<sub>q</sub>: a new adaptive regularization by cubics (Q4638924) (← links)
- On Regularization and Active-set Methods with Complexity for Constrained Optimization (Q4641664) (← links)
- On high-order model regularization for multiobjective optimization (Q5038176) (← links)
- Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models (Q5079553) (← links)
- Complexity of gradient descent for multiobjective optimization (Q5198047) (← links)
- On the Complexity of an Inexact Restoration Method for Constrained Optimization (Q5210514) (← links)
- Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact (Q5235099) (← links)
- The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization (Q5266534) (← links)
- Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (Q6046826) (← links)
- Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization (Q6097486) (← links)
- Adaptive trust-region method on Riemannian manifold (Q6111659) (← links)
- On the complexity of a stochastic Levenberg-Marquardt method (Q6149301) (← links)
- Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization (Q6489314) (← links)
- Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds (Q6593831) (← links)
- Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints (Q6659765) (← links)
