Efficent line search algorithm for unconstrained optimization
From MaRDI portal
Recommendations
- An efficient algorithm for unconstrained optimization
- A non-monotone line search algorithm for unconstrained optimization
- New line search methods for unconstrained optimization
- New inexact line search method for unconstrained optimization
- A filter-line-search method for unconstrained optimization
- scientific article; zbMATH DE number 1424213
- Convergence of line search methods for unconstrained optimization
- An algorithm for unconstrained optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Convergence and stability of line search methods for unconstrained optimization
Cites work
- A note on a sufficient-decrease criterion for a non-derivative step-length procedure
- Convergence Conditions for Ascent Methods
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 4074822 (Why is no real title available?)
- scientific article; zbMATH DE number 3487225 (Why is no real title available?)
- scientific article; zbMATH DE number 3529352 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Minimization of functions having Lipschitz continuous first partial derivatives
- On Steepest Descent
- Testing Unconstrained Optimization Software
Cited in
(23)- Acceleration of conjugate gradient algorithms for unconstrained optimization
- A new trust region method with adaptive radius
- A multi-local optimization algorithm
- Accelerated double direction method for solving unconstrained optimization problems
- Adaptive fault-tolerant position control of a hexacopter subject to an unknown motor failure
- A globalization procedure for solving nonlinear systems of equations
- Convergence of line search methods for unconstrained optimization
- Solving linear systems involved in constrained optimization
- Hybridization of accelerated gradient descent method
- The convergence of subspace trust region methods
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- Stochastic iterative dynamic programming: a Monte Carlo approach to dual control
- Computer Algebra and Line Search
- The application of gradient-only optimization methods for problems discretized using non-constant methods
- Line search algorithms with guaranteed sufficient decrease
- New BFGS method for unconstrained optimization problem based on modified armijo line search
- Efficient Line Search Methods for Convex Functions
- Accelerated gradient descent methods with line search
- A gradient-related algorithm with inexact line searches
- A line search improvement of efficient MPC
- Nonmonotone adaptive trust region method
- Real-time motion planning for multibody systems
- An accelerated double step size model in unconstrained optimization
This page was built for publication: Efficent line search algorithm for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1896577)
