Complexity analysis for optimization methods

DOI10.1360/N012018-00251MaRDI QIDQ5064233zbMATH OpenFDO

Authors Qichao Wang, Zaiwen Wen, Guanghui Lan, Yaxiang Yuan

Publication date 21 March 2022

Published in SCIENTIA SINICA Mathematica (Search for Journal in Brave)

zbMATH Keywords

complexity analysisconditional gradient methodoptimization methodaccelerated gradient methodstochastic optimization method

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Complexity and performance of numerical algorithms (65Y20) Stochastic programming (90C15) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Analysis and design of optimization algorithms via integral quadratic constraints
• An elementary approach to tight worst case complexity analysis of gradient based methods
• Convex optimization: algorithms and complexity
• scientific article; zbMATH DE number 7246283
• Regional complexity analysis of algorithms for nonconvex smooth optimization

Cited in

(8)

• scientific article; zbMATH DE number 4172753 (Why is no real title available?)
• An elementary approach to tight worst case complexity analysis of gradient based methods
• The complexity of optimization problems
• Methods of optimization and systems analysis for problems of transcomputational complexity.
• A non-parameter filled function method for unconstrained global optimization problems
• scientific article; zbMATH DE number 501506 (Why is no real title available?)
• On the computational complexity of cost efficiency analysis models
• scientific article; zbMATH DE number 5799870 (Why is no real title available?)

This page was built for publication: Complexity analysis for optimization methods

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