Pages that link to "Item:Q285034"
From MaRDI portal
The following pages link to Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034):
Displaying 6 items.
- Globally convergent BFGS method for nonsmooth convex optimization (Q1573986) (← links)
- A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems (Q1649149) (← links)
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions (Q3389584) (← links)
- Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds (Q4609464) (← links)
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints (Q4631819) (← links)
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization (Q4646678) (← links)
