Pages that link to "Item:Q2826817"
From MaRDI portal
The following pages link to Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case (Q2826817):
Displaying 27 items.
- CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method (Q679580) (← links)
- On the construction of quadratic models for derivative-free trust-region algorithms (Q1688943) (← links)
- An indicator for the switch from derivative-free to derivative-based optimization (Q1728260) (← links)
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208) (← links)
- Inexact derivative-free optimization for bilevel learning (Q2036198) (← links)
- Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations (Q2052297) (← links)
- Derivative-free robust optimization by outer approximations (Q2288189) (← links)
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds (Q2288191) (← links)
- A derivative-free Gauss-Newton method (Q2295977) (← links)
- Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components (Q4554066) (← links)
- ASTRO-DF: A Class of Adaptive Sampling Trust-Region Algorithms for Derivative-Free Stochastic Optimization (Q4561224) (← links)
- Model-Based Derivative-Free Methods for Convex-Constrained Optimization (Q5043286) (← links)
- A Stochastic Levenberg--Marquardt Method Using Random Models with Complexity Results (Q5075237) (← links)
- A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization (Q5085238) (← links)
- Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
- Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions (Q5203798) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Manifold Sampling for $\ell_1$ Nonconvex Optimization (Q5506685) (← links)
- A Trust-region Method for Nonsmooth Nonconvex Optimization (Q5881403) (← links)
- Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization (Q5883313) (← links)
- Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
- Direct Search Based on Probabilistic Descent in Reduced Spaces (Q6071887) (← links)
- Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization (Q6097486) (← links)
- Quadratic regularization methods with finite-difference gradient approximations (Q6175465) (← links)
- Worst-case evaluation complexity of a derivative-free quadratic regularization method (Q6181370) (← links)
- Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization (Q6489314) (← links)
