Pages that link to "Item:Q1675558"
From MaRDI portal
The following pages link to Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization (Q1675558):
Displayed 37 items.
- Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality (Q504812) (← links)
- On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392) (← links)
- A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis (Q1730832) (← links)
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← links)
- Cubic regularization in symmetric rank-1 quasi-Newton methods (Q1741108) (← 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 generalized worst-case complexity analysis for non-monotone line searches (Q2028039) (← links)
- On large-scale unconstrained optimization and arbitrary regularization (Q2070329) (← links)
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
- A cubic regularization of Newton's method with finite difference Hessian approximations (Q2138398) (← links)
- On the use of third-order models with fourth-order regularization for unconstrained optimization (Q2182770) (← links)
- An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem (Q2275169) (← links)
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds (Q2288191) (← links)
- A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization (Q2297654) (← 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)
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (Q2419564) (← links)
- Run-and-inspect method for nonconvex optimization and global optimality bounds for R-local minimizers (Q2425163) (← links)
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization (Q2696932) (← links)
- On High-order Model Regularization for Constrained Optimization (Q4602340) (← links)
- On Regularization and Active-set Methods with Complexity for Constrained Optimization (Q4641664) (← links)
- Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization (Q4641667) (← links)
- Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions (Q4646444) (← links)
- On high-order model regularization for multiobjective optimization (Q5038176) (← links)
- A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization (Q5085238) (← links)
- A concise second-order complexity analysis for unconstrained optimization using high-order regularized models (Q5210739) (← links)
- (Q5214226) (← 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)
- Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians (Q5737717) (← links)
- Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization (Q5853562) (← links)
- A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization (Q6109884) (← links)
- A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees (Q6114780) (← links)
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees (Q6116250) (← links)
- Adaptive Third-Order Methods for Composite Convex Optimization (Q6171322) (← links)
- Gradient regularization of Newton method with Bregman distances (Q6201850) (← links)