• No results found

Iteration and Optimization

Higher Order Iteration Schemes for Unconstrained Optimization

Higher Order Iteration Schemes for Unconstrained Optimization

... Using a predictor-corrector tactic, this paper derives new iteration schemes for unconstrained optimization. It yields a point (predictor) by some line search from the current point; then with the two ...

11

Comparison of Particle Swarm Optimization with Lambda Iteration Method to Solve the Economic Load Dispatch Problem

Comparison of Particle Swarm Optimization with Lambda Iteration Method to Solve the Economic Load Dispatch Problem

... lambda iteration method, gradient search, the base point and participation method ...an optimization problem using this methods the selection of suitable starting point is very ...swarm optimization ...

8

Economic dispatch with valve point effect using iteration particle swarm optimization

Economic dispatch with valve point effect using iteration particle swarm optimization

... an iteration particle swarm optimization (IPSO) method has been successfully applied to solve the ED problem taking into account the valve point ...new iteration best parameter is employed to update ...

6

A random 
		synchronous asynchronous particle swarm optimization algorithm with a 
		new iteration strategy

A random synchronous asynchronous particle swarm optimization algorithm with a new iteration strategy

... Random asynchronous PSO (RA-PSO) is a variation of A-PSO algorithm [5]. The RA-PSO algorithm is presented in Figure-4. The particles to be updated are chosen randomly with repetition allowed. Therefore, a particle can be ...

6

Iteration Complexity of Feasible Descent Methods for Convex Optimization

Iteration Complexity of Feasible Descent Methods for Convex Optimization

... In many machine learning problems such as the dual form of SVM, the objective function to be minimized is convex but not strongly convex. This fact causes difficulties in obtaining the complexity of some commonly used ...

26

New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems

New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems

... As we mentioned, our kernel function () is eligible. To obtain an upper bound for a μ-updated proximity function in each outer iteration in the algorithm, we use the well- known Lemma ., which can be induced ...

22

Yield Improvement and Minimization of Sand Inclusion Defect in Steel Casting

Yield Improvement and Minimization of Sand Inclusion Defect in Steel Casting

... design optimization of riser system by fluid flow and solidification for pump housing through several simulation iteration, it was concluded that defect free casting could be obtained by modifying the ...

5

Descent methods for convex optimization problems in Banach spaces

Descent methods for convex optimization problems in Banach spaces

... consider optimization problems in Banach spaces, whose cost functions are convex and smooth, but do not possess strengthened convexity ...of iteration sequences to a solution of the initial ...

11

Design and Weight Optimization of Fuel Tank Mounting Bracket for HCV

Design and Weight Optimization of Fuel Tank Mounting Bracket for HCV

... plots. Optimization FEA module was used for finding out possible material removal regions and approximately 14 % materials was reduced using different design iteration taking the guidelines from load ...

9

Dual L1 normalized context aware tensor power iteration and its applications to multi object tracking and multi graph matching

Dual L1 normalized context aware tensor power iteration and its applications to multi object tracking and multi graph matching

... an optimization problem which is solved by the graduated assignment algorithm (Gold and Rangarajan 1996), the inte- ger projected fixed point method (Leordeanu et  ...

34

Pipeline Iteration

Pipeline Iteration

... on optimization has made system improvements very difficult to achieve; yet our relatively simple architecture yields statisti- cally significant improvements, making pipeline it- eration a promising approach for ...

8

Swarm based features selection for text summarization

Swarm based features selection for text summarization

... swarm optimization. The particle swarm optimization is trained using DUC 2002 data to learn the weight of each ...each iteration, the particle swarm optimization selects some features, then ...

5

Model Based Aligner Combination Using Dual Decomposition

Model Based Aligner Combination Using Dual Decomposition

... Because we set a maximum number of iterations n in the dual decomposition algorithm, and each iteration only involves optimization in a sequence model, our entire inference procedure is [r] ...

10

Download
			
			
				Download PDF

Download Download PDF

... Lambda Iteration and Particle swarm optimization as shown in Table V and Table VI respectively are compared ...Swarm Optimization is seen to converge at a lower total cost of generation compared to ...

12

A Lagrangean Heuristic For The Degree Constrained Minimal Spanning Tree Problem

A Lagrangean Heuristic For The Degree Constrained Minimal Spanning Tree Problem

... subgradient optimization method is used to find multipliers that give good lower ...each iteration of the subgradient optimization to generate a feasible solution from an infeasible Lagrangean ...

6

Advanced ACO Metaheuristic for Travelling Salesman Problem: A Proposed Technique

Advanced ACO Metaheuristic for Travelling Salesman Problem: A Proposed Technique

... each iteration ants probabilistically construct solutions to the combinatorial optimization problem under consideration, exploiting a given pheromone model ...every iteration the values of pheromone ...

6

A NOVEL LEADER ELECTION ALGORITHM FOR HONEYCOMB MESH NETWORKS

A NOVEL LEADER ELECTION ALGORITHM FOR HONEYCOMB MESH NETWORKS

... swarm optimization” is given in Table 1Error! Reference source not ...the iteration have finished, we update the global Pareto and iteration ...

11

Adaptive Morley element algorithms for the biharmonic eigenvalue problem

Adaptive Morley element algorithms for the biharmonic eigenvalue problem

... [0.5, 1]) by Algorithms 1–2 to demonstrate the advantages of the adaptive Morley ele- ment method based on the inverse-shift iteration for a biharmonic eigenvalue problem. Our programs are compiled on MATLAB2012a ...

21

A history of inverse iteration

A history of inverse iteration

... inverse iteration [26], considered by many to be the denitive treatment, Wilkinson argues that there is no danger in solving an ill-conditioned sys- ...inverse iteration is related to Newton's method for ...

7

Iteration in Asynchronous System

Iteration in Asynchronous System

... The actor model in computer science is a mathematical model of concurrent computation that treats "actors" as the universal primitives of concurrent computation,[r] ...

9

Show all 10000 documents...

Related subjects