Pages that link to "Item:Q5959297"
From MaRDI portal
The following pages link to A survey of quasi-Newton equations and quasi-Newton methods for optimization (Q5959297):
Displaying 26 items.
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (Q283997) (← links)
- Scaling damped limited-memory updates for unconstrained optimization (Q306311) (← links)
- A combined class of self-scaling and modified quasi-Newton methods (Q453615) (← links)
- Spectral scaling BFGS method (Q604256) (← links)
- A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique (Q723782) (← links)
- A compact limited memory method for large scale unconstrained optimization (Q869145) (← links)
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434) (← links)
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems (Q1014949) (← links)
- Two adaptive Dai-Liao nonlinear conjugate gradient methods (Q1787816) (← links)
- A Newton-like trust region method for large-scale unconstrained nonconvex minimization (Q2015579) (← links)
- Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing (Q2083385) (← links)
- Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model (Q2165892) (← links)
- A hybrid quasi-Newton method with application in sparse recovery (Q2167383) (← links)
- A modified scaled memoryless symmetric rank-one method (Q2193423) (← links)
- A subspace modified Broyden-Fletcher-Goldfarb-Shanno method for \(\mathcal{B} \)-eigenvalues of symmetric tensors (Q2302750) (← links)
- A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization (Q2441364) (← links)
- A CLASS OF MODIFIED BFGS METHODS WITH FUNCTION VALUE INFORMATION FOR UNCONSTRAINED OPTIMIZATION (Q2873833) (← links)
- Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems (Q2926061) (← links)
- A CONTINUATION APPROACH USING NCP FUNCTION FOR SOLVING MAX-CUT PROBLEM (Q3638702) (← links)
- MATRIX ANALYSES ON THE DAI–LIAO CONJUGATE GRADIENT METHOD (Q4966642) (← links)
- On the Local and Superlinear Convergence of a Parameterized DFP Method (Q5409730) (← links)
- Two hybrid nonlinear conjugate gradient methods based on a modified secant equation (Q5495572) (← links)
- Quasi-Newton algorithms for solving interval-valued multiobjective optimization problems by using their certain equivalence (Q6056223) (← links)
- Eigenvalue analyses on the memoryless Davidon-Fletcher-Powell method based on a spectral secant equation (Q6142074) (← links)
- A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM (Q6142230) (← links)
- A new conjugate gradient method for acceleration of gradient descent algorithms (Q6491230) (← links)