• No results found

[PDF] Top 20 An efficient algorithm for steepest descent method for unconstrained optimization

Has 10000 "An efficient algorithm for steepest descent method for unconstrained optimization" found on our website. Below are the top 20 most common "An efficient algorithm for steepest descent method for unconstrained optimization".

An efficient algorithm for steepest descent method for unconstrained optimization

An efficient algorithm for steepest descent method for unconstrained optimization

... Barzilai-Borwein method ensures superlinear convergence and performs quite ...Barzilai-Borwein method is not monotone, thus it is not easy to be generalized for general nonlinear ... See full document

14

A Generalized Hybrid Steepest-Descent Method for Variational Inequalities in Banach Spaces

A Generalized Hybrid Steepest-Descent Method for Variational Inequalities in Banach Spaces

... gradient method was first proposed by Goldstein 7 and Levitin and Polyak 8 for solving convexly constrained minimization ...This method is regarded as an extension of the steepest-descent or ... See full document

28

New Programming Approach for Steepest Descent Optimization of Rocket Trajectories

New Programming Approach for Steepest Descent Optimization of Rocket Trajectories

... A new programming approach for steepest descent optimization of rocket trajectories is presented in this paper. From the results it is clear that the final objectives are achieved with optimum ... See full document

7

Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization

Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization

... proposed method is that the generated directions are always ...of unconstrained optimization problems from [18], which indicates the proposed method possesses better performances when compared ... See full document

12

Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization

Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization

... convex optimization problem with a fixed point constraint along with proof that these algorithms converge strongly to the unique solution of problems with a strongly monotone ...hierarchical optimization ... See full document

24

Hybrid Steepest Descent Method with Variable Parameters for General Variational Inequalities

Hybrid Steepest Descent Method with Variable Parameters for General Variational Inequalities

... hybrid steepest-descent method for variational inequality problems over the intersection of the fixed point sets of nonexpansive mappings,” in Inherently Parallel Algorithms in Feasibility and ... See full document

14

Global convergence of a modified conjugate gradient method

Global convergence of a modified conjugate gradient method

... of Algorithm . with those of the PRP+ method [] and the CG-DESCENT method [] in the number of function evaluations and CPU time in seconds with the strong Wolfe line ...large-scaled ... See full document

12

Optimal Control of Microgrid Networks Using Gradient Descent and Differential Evolution Methods

Optimal Control of Microgrid Networks Using Gradient Descent and Differential Evolution Methods

... global optimization of optimal control ...presents Steepest Descent method. The Newton method is described in Section ...Evolution method is discussed in section ...Gradient ... See full document

7

Efficient implementation of a modified and relaxed hybrid steepest descent method for a type of variational inequality

Efficient implementation of a modified and relaxed hybrid steepest descent method for a type of variational inequality

... a method for unifying the treatment of equilibrium problems encountered in areas as diverse as economics, optimal control, game theory, transportation science, and ...mathematical optimization problems, ... See full document

13

A Line Search Algorithm for Unconstrained Optimization

A Line Search Algorithm for Unconstrained Optimization

... the steepest descent direction as the restart condition automatically when the next iteration point is approximate to the current ...gradient method (see [4,15] ...gradient method, Polak and ... See full document

7

1.
													First and second order training algorithms for artificial neural networks to detect the cardiac state

1. First and second order training algorithms for artificial neural networks to detect the cardiac state

... computationally efficient method[1]-[3]. This method is known as error backpropagation, finds the derivatives of an error function with respect to the weights and biases of the ...different ... See full document

8

A DESCENT PRP CONJUGATE GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION

A DESCENT PRP CONJUGATE GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION

... At the same time, for more comprehensive comparison between the methods, we adopt the performance profiles of Dolan and Mor´ e [7] to to evaluate the number of iterations and the number of function evaluations. In ... See full document

14

A New Descent Nonlinear Conjugate Gradient Method for Unconstrained Optimization

A New Descent Nonlinear Conjugate Gradient Method for Unconstrained Optimization

... the algorithm satisfys Property ...this method is globally ...MN algorithm has higher precision and less number of times of ...VMN algorithm, it also have the sufficient de- scent property and ... See full document

5

Global Convergence of an Extended Descent Algorithm without Line Search for Unconstrained Optimization

Global Convergence of an Extended Descent Algorithm without Line Search for Unconstrained Optimization

... Fletcher-Reeves method, Hestenes-Stiefel method, Dai-Yuan method, Polak- Ribière method and Conjugate Descent ...proposed descent methods without line search in [9] and [10], ... See full document

8

Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems   Pages 19-34
		 Download PDF

Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems Pages 19-34 Download PDF

... own algorithm-specific control ...HS algorithm uses harmony memory consideration rate, pitch adjusting rate, and the number of ...respective algorithm-specific parameters. The proper tuning of the ... See full document

16

A Regularized Newton Method with Correction for Unconstrained Convex Optimization

A Regularized Newton Method with Correction for Unconstrained Convex Optimization

... Newton algorithm with correc- tion by trust region technique, and then prove the global convergence of the new algorithm under some suitable ...Newton algorithm with correction and compared it with a ... See full document

9

Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping

Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping

... Picard algorithm to the smooth convex minimization problem and point out that the Picard algorithm is the steepest descent method for solving the minimization ...Picard algorithm ... See full document

12

Mann type hybrid steepest descent method for three nonlinear problems

Mann type hybrid steepest descent method for three nonlinear problems

... iterative algorithm is based on Korpelevich’s extragradient method, the viscosity approximation method [], Mann’s it- eration method, and the hybrid steepest-descent ...erative ... See full document

29

Low Power Realization of FIR Filters Using Optimization Techniques

Low Power Realization of FIR Filters Using Optimization Techniques

... for efficient computation of weighted ...FIR algorithm can then be mapped onto this architecture as a series of MAC ...FIR algorithm, the coefficient values directly impact the signal switching ... See full document

7

A multi-objective improved teaching-learning based optimization algorithm for unconstrained and constrained optimization problems   Pages 1-22
		 Download PDF

A multi-objective improved teaching-learning based optimization algorithm for unconstrained and constrained optimization problems Pages 1-22 Download PDF

... proposed algorithm and the other algorithm is less than the significance ratio then it indicates the statistically better performance of the proposed ...proposed algorithm and the other algorithms ... See full document

22

Show all 10000 documents...