Pages that link to "Item:Q5737717"
From MaRDI portal
The following pages link to Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians (Q5737717):
Displayed 29 items.
- On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392) (← links)
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints (Q1995981) (← links)
- A generalized worst-case complexity analysis for non-monotone line searches (Q2028039) (← links)
- Minimizing uniformly convex functions by cubic regularization of Newton method (Q2032037) (← links)
- On large-scale unconstrained optimization and arbitrary regularization (Q2070329) (← links)
- A control-theoretic perspective on optimal high-order optimization (Q2089793) (← links)
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
- Local convergence of tensor methods (Q2133417) (← links)
- A cubic regularization of Newton's method with finite difference Hessian approximations (Q2138398) (← links)
- Smoothness parameter of power of Euclidean norm (Q2178876) (← links)
- Implementable tensor methods in unconstrained convex optimization (Q2227532) (← links)
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
- Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems (Q2419539) (← links)
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (Q2419564) (← links)
- The impact of noise on evaluation complexity: the deterministic trust-region case (Q2696963) (← links)
- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy (Q4629334) (← links)
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (Q4634141) (← links)
- On Regularization and Active-set Methods with Complexity for Constrained Optimization (Q4641664) (← links)
- Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions (Q4646444) (← links)
- Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives (Q4971023) (← links)
- On high-order model regularization for multiobjective optimization (Q5038176) (← links)
- On the complexity of solving feasibility problems with regularized models (Q5038424) (← links)
- Tensor methods for finding approximate stationary points of convex functions (Q5038435) (← links)
- Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints (Q5217594) (← links)
- On inexact solution of auxiliary problems in tensor methods for convex optimization (Q5859013) (← links)
- High-Order Optimization Methods for Fully Composite Problems (Q5869820) (← links)
- Super-Universal Regularized Newton Method (Q6136654) (← links)
- Adaptive Third-Order Methods for Composite Convex Optimization (Q6171322) (← links)
- Optimal Transport Approximation of 2-Dimensional Measures (Q6175992) (← links)