Pages that link to "Item:Q4372656"
From MaRDI portal
The following pages link to A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization (Q4372656):
Displaying 28 items.
- Trust region algorithm with two subproblems for bound constrained problems (Q279647) (← links)
- Limited-memory BFGS systems with diagonal updates (Q417600) (← links)
- An accurate active set Newton algorithm for large scale bound constrained optimization. (Q548593) (← links)
- An active set strategy based on the multiplier function or the gradient. (Q622855) (← links)
- Modified active set projected spectral gradient method for bound constrained optimization (Q638841) (← links)
- An active set limited memory BFGS algorithm for bound constrained optimization (Q638888) (← links)
- A new class of supermemory gradient methods (Q865511) (← links)
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q870176) (← links)
- An active-set projected trust region algorithm for box constrained optimization problems (Q905153) (← links)
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization (Q929334) (← links)
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q955062) (← links)
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258) (← links)
- Limited memory quasi-Newton method for large-scale linearly equality-constrained minimization (Q1582578) (← links)
- A decomposition method for large-scale box constrained optimization (Q1644498) (← links)
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization (Q1722397) (← links)
- Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation (Q1827220) (← links)
- A neural network model with bounded-weights for pattern classification (Q1883892) (← links)
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization (Q1935275) (← links)
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization (Q1938913) (← links)
- A Newton-like trust region method for large-scale unconstrained nonconvex minimization (Q2015579) (← links)
- A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems (Q2069440) (← links)
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm (Q2176186) (← links)
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization (Q2448155) (← links)
- AN ADAPTIVE GRADIENT ALGORITHM FOR LARGE-SCALE NONLINEAR BOUND CONSTRAINED OPTIMIZATION (Q2846484) (← links)
- A trust region method based on a new affine scaling technique for simple bounded optimization (Q2867413) (← links)
- An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations (Q2868903) (← links)
- Improving ultimate convergence of an augmented Lagrangian method (Q3539788) (← links)
- A class of projected-search methods for bound-constrained optimization (Q6640991) (← links)
