Complexity of a class of first-order objective-function-free optimization algorithms
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- A note on using performance and data profiles for training algorithms
- Adaptive subgradient methods for online learning and stochastic optimization
- An adaptive trust-region method without function evaluations
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Concise complexity analyses for trust region methods
- Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound
- Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives
- First-order methods in optimization
- Introductory lectures on convex optimization. A basic course.
- On the Lambert \(w\) function
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- On the limited memory BFGS method for large scale optimization
- Optimality Measures for Performance Profiles
- Recent advances in trust region algorithms
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- Sequential convergence of AdaGrad algorithm for smooth convex optimization
- Solving the Trust-Region Subproblem using the Lanczos Method
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- The impact of noise on evaluation complexity: the deterministic trust-region case
- Trust Region Methods
- Two-Point Step Size Gradient Methods
This page was built for publication: Complexity of a class of first-order objective-function-free optimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238774)
