Pages that link to "Item:Q743632"

The following pages link to Worst case complexity of direct search (Q743632):

Displaying 26 items.

• On the optimal order of worst case complexity of direct search (Q276315) (← links)
• Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (Q526842) (← links)
• Complexity bounds for second-order optimality in unconstrained optimization (Q657654) (← links)
• On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392) (← 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)
• Worst-case complexity bounds of directional direct-search methods for multiobjective optimization (Q2026717) (← links)
• Expected complexity analysis of stochastic direct-search (Q2070336) (← links)
• Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations (Q2082542) (← links)
• Efficient unconstrained black box optimization (Q2146451) (← links)
• Derivative-free methods for mixed-integer constrained optimization problems (Q2342138) (← links)
• Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520) (← links)
• On the complexity of finding first-order critical points in constrained nonlinear optimization (Q2452373) (← links)
• Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models (Q2802144) (← links)
• A second-order globally convergent direct-search method and its worst-case complexity (Q2810113) (← links)
• On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization (Q2815548) (← links)
• Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case (Q2826817) (← links)
• A derivative-free comirror algorithm for convex optimization (Q3458813) (← links)
• Improving Direct Search algorithms by multilevel optimization techniques (Q3458830) (← links)
• Direct Search Based on Probabilistic Descent (Q5502242) (← links)
• Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
• Direct Search Based on Probabilistic Descent in Reduced Spaces (Q6071887) (← 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)