Convergence of Trust-Region Methods Based on Probabilistic Models
From MaRDI portal
Publication:2934477
DOI10.1137/130915984zbMath1311.90186DBLPjournals/siamjo/BandeiraSV14arXiv1304.2808OpenAlexW2098840904WikidataQ58040517 ScholiaQ58040517MaRDI QIDQ2934477
Katya Scheinberg, Afonso S. Bandeira, Luis Nunes Vicente
Publication date: 12 December 2014
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.2808
unconstrained optimizationglobal convergencederivative-free optimizationprobabilistic modelstrust-region methods
Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (44)
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 ⋮ A Levenberg-Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients ⋮ A progressive barrier derivative-free trust-region algorithm for constrained optimization ⋮ Survey of derivative-free optimization ⋮ A fully stochastic second-order trust region method ⋮ Stochastic derivative-free optimization using a trust region framework ⋮ Levenberg--Marquardt Methods Based on Probabilistic Gradient Models and Inexact Subproblem Solution, with Application to Data Assimilation ⋮ Efficient unconstrained black box optimization ⋮ Descent direction method with line search for unconstrained optimization in noisy environment ⋮ Global convergence rate analysis of unconstrained optimization methods based on probabilistic models ⋮ Stochastic optimization using a trust-region method and random models ⋮ ASTRO-DF: A Class of Adaptive Sampling Trust-Region Algorithms for Derivative-Free Stochastic Optimization ⋮ A Stochastic Levenberg--Marquardt Method Using Random Models with Complexity Results ⋮ Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models ⋮ Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions ⋮ Coupled Learning Enabled Stochastic Programming with Endogenous Uncertainty ⋮ A Stochastic Trust-Region Framework for Policy Optimization ⋮ Scalable subspace methods for derivative-free nonlinear least-squares optimization ⋮ An adaptive stochastic sequential quadratic programming with differentiable exact augmented Lagrangians ⋮ Convergence analysis of a subsampled Levenberg-Marquardt algorithm ⋮ Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming ⋮ Direct search based on probabilistic feasible descent for bound and linearly constrained problems ⋮ Direct Search Based on Probabilistic Descent in Reduced Spaces ⋮ Optimization by moving ridge functions: derivative-free optimization for computationally intensive functions ⋮ Global optimization using random embeddings ⋮ Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates ⋮ Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings ⋮ Trust-region algorithms: probabilistic complexity and intrinsic noise with applications to subsampling techniques ⋮ Newton-type methods for non-convex optimization under inexact Hessian information ⋮ The impact of noise on evaluation complexity: the deterministic trust-region case ⋮ Convergence of Newton-MR under Inexact Hessian Information ⋮ A Derivative-Free Trust-Region Algorithm for the Optimization of Functions Smoothed via Gaussian Convolution Using Adaptive Multiple Importance Sampling ⋮ Projected adaptive cubic regularization algorithm with derivative-free filter technique for box constrained optimization ⋮ Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates ⋮ Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions ⋮ A Stochastic Line Search Method with Expected Complexity Analysis ⋮ Derivative-free optimization methods ⋮ Expected complexity analysis of stochastic direct-search ⋮ Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization ⋮ Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations ⋮ Linesearch Newton-CG methods for convex optimization with noise ⋮ Direct Search Based on Probabilistic Descent ⋮ Recent advances in trust region algorithms ⋮ A stochastic first-order trust-region method with inexact restoration for finite-sum minimization
This page was built for publication: Convergence of Trust-Region Methods Based on Probabilistic Models
