Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
complexity estimates
Description:
Bounds or measures of the computational effort required by algorithms, particularly optimization methods, as a function of problem size or accuracy.
Related topics:
Advanced Optimization Algorithms Research (17%),
Polynomial and algebraic computation (15%),
Optimization and Variational Analysis (9%)
OpenAlex ID:
keywords/complexity-estimates
First-order methods of smooth convex optimization with inexact oracle
2013
·
Olivier Devolder
, François Glineur
, et al.
·
Mathematical Programming
·
617
Euclidean Jordan Algebras and Interior-point Algorithms
1997
·
Leonid Faybusovich
·
Positivity
·
224
Quasi-periodic solutions with Sobolev regularity of NLS on $\mathbb T^d$ with a multiplicative potential
2012
·
Massimiliano Berti
, Philippe Bolle
·
Journal of the European Mathematical Society
·
172
PDF
Complexity estimates of some cutting plane methods based on the analytic barrier
1995
·
Yu. Nesterov
·
Mathematical Programming
·
123
A sparse H-matrix arithmetic: general complexity estimates
2000
·
W. Hackbusch
, B.N. Khoromskij
·
Journal of Computational and Applied Mathematics
·
98
PDF
A Jordan-algebraic approach to potential-reduction algorithms
2002
·
Leonid Faybusovich
·
Mathematische Zeitschrift
·
93
Douglas-rachford splitting: Complexity estimates and accelerated variants
2014
·
Panagiotis Patrinos
, Lorenzo Stella
, et al.
·
IEEE Conference on Decision and Control (CDC)
·
89
PDF
Complexity regularization via localized random penalties
2004
·
Gábor Lugosi
, Marten Wegkamp
·
The Annals of Statistics
·
69
PDF
On Hilbert's thirteenth problem and related questions
2004
·
A G Vitushkin
·
Russian Mathematical Surveys
·
56
Testing Sign Conditions on a Multivariate Polynomial and Applications
2007
·
Mohab Safey El Din
·
Mathematics in Computer Science
·
55
About problems of decoding and searching for the maximum upper zero of discrete monotone functions
2019
·
A V Kabulov
, I H Normatov
·
Journal of Physics Conference Series
·
49
PDF
Complexity of hierarchical refinement for a class of admissible mesh configurations
2016
·
Annalisa Buffa
, Carlotta Giannelli
, et al.
·
Computer Aided Geometric Design
·
46
PDF
Infinite-Dimensional Quadratic Optimization: Interior-Point Methods and Control Applications
1997
·
L. Faybusovich
, J. B. Moore
·
Applied Mathematics & Optimization
·
20
On the Representation of Solutions to Elliptic PDEs in Barron Spaces
2021
·
Chen, Ziang
, Lu, Jianfeng
, et al.
·
arXiv (Cornell University)
·
17
PDF
A long-step primal–dual algorithm for the symmetric programming problem
2001
·
L. Faybusovich
, R. Arana
·
Systems & Control Letters
·
17
Semidefinite Programming: A Path-Following Algorithm for a Linear–Quadratic Functional
1996
·
Leonid Faybusovich
·
SIAM Journal on Optimization
·
16
On the analytic complexity of discriminants
2012
·
V. A. Krasikov
, T. M. Sadykov
·
Proceedings of the Steklov Institute of Mathematics
·
15
A geometric multigrid method based on L-shaped coarsening for PDEs on stretched grids
2009
·
H. Bin Zubair
, S. P. MacLachlan
, et al.
·
Numerical Linear Algebra with Applications
·
15
PDF
Parabolic target space and primal–dual interior-point methods
2007
·
Yu. Nesterov
·
Discrete Applied Mathematics
·
14
The Complexity of Algebraic Algorithms for LWE
2024
·
Matthias Johann Steiner
·
Lecture notes in computer science
·
13
PDF
A Self-Concordant Interior Point Approach for Optimal Control with State Constraints
2015
·
Florian Kruse
, Michael Ulbrich
·
SIAM Journal on Optimization
·
13
Exploring the Six Worlds of Gröbner Basis Cryptanalysis: Application to Anemoi
2024
·
Katharina Koschatko
, Reinhard Lüftenegger
, et al.
·
IACR Transactions on Symmetric Cryptology
·
12
PDF
Algorithms for Solving Variational Inequalities and Saddle Point Problems with Some Generalizations of Lipschitz Property for Operators
2021
·
Alexander A. Titov
, Fedor S. Stonyakin
, et al.
·
Communications in computer and information science
·
10
PDF
On the complexity of a unified convergence analysis for iterative methods
2023
·
Ioannis K. Argyros
, Stepan Shakhno
, et al.
·
Journal of Complexity
·
9
Computing the Integer Points of a Polyhedron, II: Complexity Estimates
2017
·
Rui-Juan Jing
, Marc Moreno Maza
·
Lecture notes in computer science
·
9
Show more works
View as search
Works count:
87
Citation count:
1,995
Year
Topic
Type