Accelerated double direction method for solving unconstrained optimization problems
From MaRDI portal
Recommendations
- Accelerated multiple step-size methods for solving unconstrained optimization problems
- A transformation of accelerated double step size method for unconstrained optimization
- An accelerated double step size model in unconstrained optimization
- On the acceleration of the double smoothing technique for unconstrained convex optimization problems
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- Accelerated diagonal gradient-type method for large-scale unconstrained optimization
- Unconstrained optimization techniques for the acceleration of alternating projection methods
- Accelerated diagonal steepest descent method for unconstrained multiobjective optimization
- New conjugate direction method for unconstrained optimization
- A direct search conjugate directions algorithm for unconstrained minimization
Cites work
- scientific article; zbMATH DE number 3718477 (Why is no real title available?)
- scientific article; zbMATH DE number 3529352 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A multi-step curve search algorithm in nonlinear optimization
- A multi-step curve search algorithm in nonlinear optimization: nondifferentiable convex case
- Accelerated gradient descent methods with line search
- An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- An unconstrained optimization test functions collection
- Convergence Conditions for Ascent Methods
- Convergence of line search methods for unconstrained optimization
- Efficent line search algorithm for unconstrained optimization
- Function minimization by conjugate gradients
- Linear and nonlinear programming.
- Minimization of functions having Lipschitz continuous first partial derivatives
- Optimization theory and methods. Nonlinear programming
- Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations
- Two-Point Step Size Gradient Methods
- \(R\)-linear convergence of the Barzilai and Borwein gradient method
Cited in
(20)- On solving double direction methods for convex constrained monotone nonlinear equations with image restoration
- Modification of the double direction approach for solving systems of nonlinear equations with application to Chandrasekhar's integral equation
- On an iterative method for unconstrained optimization
- Objective acceleration for unconstrained optimization
- Accelerated multiple step-size methods for solving unconstrained optimization problems
- An improved derivative-free method via double direction approach for solving systems of nonlinear equations
- Hybridization rule applied on accelerated double step size optimization scheme
- Hybridization of accelerated gradient descent method
- A transformation of accelerated double step size method for unconstrained optimization
- Solving systems of nonlinear equations using improved double direction method
- An accelerated double step size model in unconstrained optimization
- On the Hybridization of the Double Step Length Method for Solving System of Nonlinear Equations
- On the bang-bang control approach via a component-wise line search strategy for unconstrained optimization
- Initial improvement of the hybrid accelerated gradient descent process
- Signal recovery with convex constrained nonlinear monotone equations through conjugate gradient hybrid approach
- Modified matrix-free methods for solving system of nonlinear equations
- A note on hybridization process applied on transformed double step size model
- A survey of gradient methods for solving nonlinear optimization
- Efficient matrix-free direction method with line search for solving large-scale system of nonlinear equations
- Hybrid modification of accelerated double direction method
This page was built for publication: Accelerated double direction method for solving unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1719483)
