Pages that link to "Item:Q4032911"
From MaRDI portal
The following pages link to An algorithm for unconstrained optimization (Q4032911):
Displaying 21 items.
- Can Newton method be surpassed. (Q701596) (← links)
- A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization (Q747220) (← links)
- A quasi-Newton based pattern search algorithm for unconstrained optimization (Q864827) (← links)
- A new quasi-Newton algorithm (Q1095608) (← links)
- A new regularized quasi-Newton algorithm for unconstrained optimization (Q1636866) (← links)
- Optimal algorithms and the BFGS updating techniques for solving unconstrained nonlinear minimization problems (Q1714558) (← links)
- A rank-one fitting algorithm for unconstrained optimization problems. (Q1767174) (← links)
- A quasi-discrete Newton algorithm with a nonmonotone stabilization technique (Q1823152) (← links)
- Efficent line search algorithm for unconstrained optimization (Q1896577) (← links)
- Correction to: ``The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications'' (Q2282828) (← links)
- Two-phase quasi-Newton method for unconstrained optimization problem (Q2322286) (← links)
- An improvement of simulated annealing algorithm solving unconstrained optimization problem (Q2765628) (← links)
- Low‐complexity minimization algorithms (Q3599999) (← links)
- (Q3641741) (← links)
- (Q3995534) (← links)
- (Q4399178) (← links)
- A family of quasi-Newton methods for unconstrained optimization problems (Q4646526) (← links)
- A logarithm barrier method for linear programming (Q4935392) (← links)
- (Q4945586) (← links)
- A trust region algorithm for constrained optimization (Q4954033) (← links)
- Higher order derivatives in optimization methods (Q5689826) (← links)
