Minimization algorithms based on supervisor and searcher cooperation
From MaRDI portal
(Redirected from Publication:5956435)
Recommendations
- Novel supervisor-searcher cooperation algorithms for minimization problems with strong noise*
- Novel algorithms for noisy minimization problems with applications to neural networks training
- A stochastic steepest-descent algorithm
- scientific article; zbMATH DE number 4152164
- Stochastic approximation algorithm for minimax problems
Cites work
- R-linear convergence of the Barzilai and Borwein gradient method
- A method of trust region type for minimizing noisy functions
- A Nonmonotone Line Search Technique for Newton’s Method
- A Stochastic Approximation Method
- A stochastic quasigradient algorithm with variable metric
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 4043678 (Why is no real title available?)
- scientific article; zbMATH DE number 1215248 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 1043533 (Why is no real title available?)
- scientific article; zbMATH DE number 3997615 (Why is no real title available?)
- Nelder-Mead Simplex Modifications for Simulation Optimization
- On the Barzilai and Borwein choice of steplength for the gradient method
- Optimization algorithm with probabilistic estimation
- Optimization via simulation: A review
- Recent progress in unconstrained nonlinear optimization without derivatives
- Stochastic approximation methods for constrained and unconstrained systems
- Stochastic Estimation of the Maximum of a Regression Function
- Testing Unconstrained Optimization Software
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
Cited in
(16)- A descent algorithm without line search for unconstrained optimization
- Prediction-correction method with BB step sizes
- Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities
- LMBOPT: a limited memory method for bound-constrained optimization
- Fast methods for computing centroidal Laguerre tessellations for prescribed volume fractions with applications to microstructure generation of polycrystalline materials
- A new spectral method for \(l_1\)-regularized minimization
- Stable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environment
- Novel algorithms for noisy minimization problems with applications to neural networks training
- The Uzawa-MBB type algorithm for nonsymmetric saddle point problems
- On the asymptotic behaviour of some new gradient methods
- Novel supervisor-searcher cooperation algorithms for minimization problems with strong noise*
- Alternate step gradient method*
- Batch gradient method with smoothing \(L_{1/2}\) regularization for training of feedforward neural networks
- Adaptive finite element methods for the identification of elastic constants
- On the Barzilai-Borwein basic scheme in FFT-based computational homogenization
- An active set method for bound-constrained optimization
This page was built for publication: Minimization algorithms based on supervisor and searcher cooperation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956435)
