Introduction to high-order optimization methods

DOI10.15960/J.CNKI.ISSN.1007-6093.2019.03.005MaRDI QIDQ3307337zbMATH OpenFDO

Authors Xihua Zhu, Qingqing Chang, Bo Jiang

Publication date 12 August 2020

zbMATH Keywords

high-order methodsiteration complexitysolution methods for subproblem

Mathematics Subject Classification ID

Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• An optimal high-order tensor method for convex optimization
• Reachability of optimal convergence rate estimates for high-order numerical convex optimization methods
• Implementable tensor methods in unconstrained convex optimization
• Higher order derivatives in optimization methods
• Local convergence of tensor methods

Cited in

(6)

• An optimal high-order tensor method for convex optimization
• Higher-order Newton methods with polynomial work per iteration
• High-order optimization methods for fully composite problems
• A sub-sampled tensor method for nonconvex optimization
• High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods
• An adaptive high order method for finding third-order critical points of nonconvex optimization

This page was built for publication: Introduction to high-order optimization methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3307337)