Pages that link to "Item:Q2528326"
From MaRDI portal
The following pages link to An effective algorithm for minimization (Q2528326):
Displaying 37 items.
- On diagonally-preconditioning the 2-step BFGS method with accumulated steps for linearly constrained nonlinear programming (Q797502) (← links)
- On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming (Q800833) (← links)
- Global convergence properties of two modified BFGS-type methods (Q874351) (← links)
- A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule (Q949372) (← links)
- On the Shwarz alternating method in problems of elastic stability (Q1064136) (← links)
- Global convergence and stabilization of unconstrained minimization methods without derivatives (Q1090237) (← links)
- A quasi-Newton method with Cholesky factorization (Q1133299) (← links)
- A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms (Q1138482) (← links)
- A modified Newton method for minimization (Q1234556) (← links)
- Approximation methods for the unconstrained optimization (Q1234630) (← links)
- Accelerated conjugate direction methods for unconstrained optimization (Q1236069) (← links)
- Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben (Q1242859) (← links)
- A quasi-Newton method for minimization under linear constraints without evaluating any derivatives (Q1255302) (← links)
- In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization (Q1255894) (← links)
- Descentwise inexact proximal algorithms for smooth optimization (Q1935582) (← links)
- A class of gradient unconstrained minimization algorithms with adaptive stepsize (Q1970409) (← links)
- A robust algorithm for rate-independent crystal plasticity (Q2138851) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- An active set trust-region method for bound-constrained optimization (Q2169274) (← links)
- Rayleigh quotient minimization method for symmetric eigenvalue problems (Q2326347) (← links)
- Global convergence of a modified BFGS-type method for unconstrained non-convex minimization (Q2454986) (← links)
- Scaling of matrices to achieve specified row and column sums (Q2529728) (← links)
- Solution of monotone nonlinear elliptic boundary value problems (Q2545647) (← links)
- An application of the generalized Aitken-Steffensen method to the problem of minimizing a function (Q2559909) (← links)
- Stopping criteria for linesearch methods without derivatives (Q3696884) (← links)
- A note on a sufficient-decrease criterion for a non-derivative step-length procedure (Q3941205) (← links)
- Newton-type methods for unconstrained and linearly constrained optimization (Q4051917) (← links)
- A superlinearly convergent algorithm for minimization without evaluating derivatives (Q4093226) (← links)
- Practical convergence conditions for the Davidon-Fletcher-Powell method (Q4097099) (← links)
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems (Q4136969) (← links)
- Optimization of functions whose values are subject to small errors (Q4140303) (← links)
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods (Q4768565) (← links)
- Global convergece of the bfgs algorithm with nonmonotone linesearch<sup>∗</sup><sup>∗</sup>this work is supported by national natural science foundation$ef: (Q4888264) (← links)
- On Descent from Local Minima (Q5629143) (← links)
- Recent advances in unconstrained optimization (Q5636700) (← links)
- Methods of conjugate directions versus quasi-Newton methods (Q5661719) (← links)
- Practical convergence conditions for unconstrained optimization (Q5685870) (← links)