Pages that link to "Item:Q1896577"
From MaRDI portal
The following pages link to Efficent line search algorithm for unconstrained optimization (Q1896577):
Displaying 19 items.
- The application of gradient-only optimization methods for problems discretized using non-constant methods (Q381398) (← links)
- Nonmonotone adaptive trust region method (Q621656) (← links)
- Real-time motion planning for multibody systems (Q884818) (← links)
- An accelerated double step size model in unconstrained optimization (Q902839) (← links)
- Acceleration of conjugate gradient algorithms for unconstrained optimization (Q1029371) (← links)
- A new trust region method with adaptive radius (Q1029622) (← links)
- A multi-local optimization algorithm (Q1265238) (← links)
- Accelerated double direction method for solving unconstrained optimization problems (Q1719483) (← links)
- Adaptive fault-tolerant position control of a hexacopter subject to an unknown motor failure (Q1784059) (← links)
- A globalization procedure for solving nonlinear systems of equations (Q1815701) (← links)
- Convergence of line search methods for unconstrained optimization (Q1881700) (← links)
- Solving linear systems involved in constrained optimization (Q1902118) (← links)
- Hybridization of accelerated gradient descent method (Q1989937) (← links)
- The convergence of subspace trust region methods (Q2389569) (← links)
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion (Q2502232) (← links)
- Stochastic iterative dynamic programming: a Monte Carlo approach to dual control (Q2576079) (← links)
- Computer Algebra and Line Search (Q3086910) (← links)
- New BFGS method for unconstrained optimization problem based on modified Armijo line search (Q5413886) (← links)
- Accelerated gradient descent methods with line search (Q5961879) (← links)