Pages that link to "Item:Q2934477"

The following pages link to Convergence of Trust-Region Methods Based on Probabilistic Models (Q2934477):

Displaying 50 items.

• Stochastic derivative-free optimization using a trust region framework (Q301671) (← links)
• Survey of derivative-free optimization (Q827577) (← links)
• A Levenberg-Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients (Q1616028) (← links)
• A progressive barrier derivative-free trust-region algorithm for constrained optimization (Q1616931) (← links)
• Global convergence rate analysis of unconstrained optimization methods based on probabilistic models (Q1646566) (← links)
• Stochastic optimization using a trust-region method and random models (Q1646570) (← links)
• Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates (Q2028452) (← links)
• Expected complexity analysis of stochastic direct-search (Q2070336) (← links)
• Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations (Q2082542) (← links)
• Linesearch Newton-CG methods for convex optimization with noise (Q2084588) (← links)
• A stochastic first-order trust-region method with inexact restoration for finite-sum minimization (Q2111466) (← links)
• Efficient unconstrained black box optimization (Q2146451) (← links)
• Newton-type methods for non-convex optimization under inexact Hessian information (Q2205970) (← links)
• Projected adaptive cubic regularization algorithm with derivative-free filter technique for box constrained optimization (Q2244360) (← links)
• Recent advances in trust region algorithms (Q2349124) (← links)
• Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520) (← links)
• Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates (Q2687061) (← links)
• Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings (Q2687068) (← links)
• The impact of noise on evaluation complexity: the deterministic trust-region case (Q2696963) (← links)
• Levenberg--Marquardt Methods Based on Probabilistic Gradient Models and Inexact Subproblem Solution, with Application to Data Assimilation (Q3179313) (← links)
• Descent direction method with line search for unconstrained optimization in noisy environment (Q3458837) (← links)
• ASTRO-DF: A Class of Adaptive Sampling Trust-Region Algorithms for Derivative-Free Stochastic Optimization (Q4561224) (← links)
• A Derivative-Free Trust-Region Algorithm for the Optimization of Functions Smoothed via Gaussian Convolution Using Adaptive Multiple Importance Sampling (Q4641668) (← links)
• A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity (Q5031804) (← links)
• A fully stochastic second-order trust region method (Q5043844) (← links)
• A Stochastic Levenberg--Marquardt Method Using Random Models with Complexity Results (Q5075237) (← links)
• Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models (Q5079553) (← links)
• Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions (Q5081786) (← links)
• Coupled Learning Enabled Stochastic Programming with Endogenous Uncertainty (Q5085157) (← links)
• A Stochastic Trust-Region Framework for Policy Optimization (Q5096136) (← links)
• Convergence of Newton-MR under Inexact Hessian Information (Q5148404) (← links)
• Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions (Q5203798) (← links)
• A Stochastic Line Search Method with Expected Complexity Analysis (Q5215517) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization (Q5244400) (← links)
• Direct Search Based on Probabilistic Descent (Q5502242) (← links)
• Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
• An adaptive stochastic sequential quadratic programming with differentiable exact augmented Lagrangians (Q6038658) (← links)
• Convergence analysis of a subsampled Levenberg-Marquardt algorithm (Q6047687) (← links)
• Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming (Q6052061) (← links)
• Direct Search Based on Probabilistic Descent in Reduced Spaces (Q6071887) (← links)
• Optimization by moving ridge functions: derivative-free optimization for computationally intensive functions (Q6094491) (← links)
• Global optimization using random embeddings (Q6160282) (← links)
• Trust-region algorithms: probabilistic complexity and intrinsic noise with applications to subsampling techniques (Q6170037) (← links)
• Stochastic trust-region and direct-search methods: a weak tail bound condition and reduced sample sizing (Q6561380) (← links)
• Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds (Q6593831) (← links)
• First- and second-order high probability complexity bounds for trust-region methods with noisy oracles (Q6608030) (← links)
• On the global complexity of a derivative-free Levenberg-Marquardt algorithm via orthogonal spherical smoothing (Q6608067) (← links)
• Derivative-free bound-constrained optimization for solving structured problems with surrogate models (Q6641007) (← links)
• An investigation of stochastic trust-region based algorithms for finite-sum minimization (Q6644989) (← links)