Pages that link to "Item:Q5956435"
From MaRDI portal
The following pages link to Minimization algorithms based on supervisor and searcher cooperation (Q5956435):
Displayed 13 items.
- Batch gradient method with smoothing \(L_{1/2}\) regularization for training of feedforward neural networks (Q470178) (← links)
- Adaptive finite element methods for the identification of elastic constants (Q618652) (← links)
- A descent algorithm without line search for unconstrained optimization (Q1044422) (← links)
- Prediction-correction method with BB step sizes (Q1731902) (← links)
- Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities (Q2114595) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- Fast methods for computing centroidal Laguerre tessellations for prescribed volume fractions with applications to microstructure generation of polycrystalline materials (Q2236133) (← links)
- A new spectral method for \(l_1\)-regularized minimization (Q2254769) (← links)
- Stable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environment (Q2361517) (← links)
- Novel algorithms for noisy minimization problems with applications to neural networks training (Q2370047) (← links)
- The Uzawa-MBB type algorithm for nonsymmetric saddle point problems (Q2419575) (← links)
- On the asymptotic behaviour of some new gradient methods (Q2487845) (← links)
- Alternate step gradient method* (Q4467169) (← links)