Pages that link to "Item:Q995787"
From MaRDI portal
The following pages link to Accelerating the cubic regularization of Newton's method on convex problems (Q995787):
Displayed 21 items.
- Gradient methods for minimizing composite functions (Q359630) (← links)
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem (Q415364) (← links)
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization (Q429459) (← links)
- Interior-point methods for nonconvex nonlinear programming: cubic regularization (Q457205) (← links)
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (Q535013) (← links)
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity (Q652287) (← links)
- Complexity bounds for second-order optimality in unconstrained optimization (Q657654) (← links)
- Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization (Q746819) (← links)
- Global optimality conditions for cubic minimization problems with cubic constraints (Q907371) (← links)
- Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization (Q1675558) (← links)
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods (Q1942265) (← links)
- Global sufficient optimality conditions for a special cubic minimization problem (Q1955308) (← links)
- Global optimality conditions for cubic minimization problem with box or binary constraints (Q1959231) (← links)
- On global minimizers of quadratic functions with cubic regularization (Q2329649) (← links)
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (Q2515043) (← links)
- Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization (Q2885470) (← links)
- (Q2921184) (← links)
- A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities (Q3449570) (← links)
- Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (Q4638051) (← links)
- Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions (Q4646444) (← links)
- Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians (Q5737717) (← links)